{"meta":{"query_hash":"ea9efcbaf870","filters":{"venue":"Proceedings of the ASP-DAC 2005. Asia and South Pacific Design Automation Conference, 2005."},"cohort_total":8,"direct_labels_cover":0,"predictions_cover":8,"exported":8,"export_cap":100000,"truncated":false,"label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"permalink":"https://metacan.xera.ac/q/ea9efcbaf870","api":"https://metacan.xera.ac/api/v1/cohort?venue=Proceedings+of+the+ASP-DAC+2005.+Asia+and+South+Pacific+Design+Automation+Conference%2C+2005."},"results":[{"id":"W4230771668","doi":"10.1109/aspdac.2005.1466516","title":"BDD-based two variable sharing extraction","year":2005,"lang":"en","type":"article","venue":"Proceedings of the ASP-DAC 2005. Asia and South Pacific Design Automation Conference, 2005.","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Binary decision diagram; Computer science; Variable (mathematics); Theoretical computer science; Algorithm; Binary number; Product (mathematics); Exploit; Mathematics; Arithmetic","score_opus":0.03509736295451807,"score_gpt":0.27371557636361077,"score_spread":0.2386182134090927,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4230771668","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01351093,0.00007408054,0.95737207,0.0008672166,0.00033249398,0.00079664565,0.000006731195,0.0004541333,0.02658571],"genre_scores_gemma":[0.5624797,0.000009820078,0.43604082,0.000055848963,0.0000798493,0.000054890592,0.0000019888269,0.000015573896,0.0012615364],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974741,0.000073254596,0.0006844465,0.00062574015,0.00062101556,0.0005214862],"domain_scores_gemma":[0.99808824,0.00009162487,0.00078334846,0.00043830654,0.00043683383,0.00016166118],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002386276,0.00031081718,0.0003355045,0.00030897165,0.0003754945,0.0005379642,0.001105296,0.0001784849,0.00008998333],"category_scores_gemma":[0.0002478188,0.00026101127,0.00008932871,0.0005419626,0.00013815431,0.0018503821,0.00016086116,0.00030934814,0.000051009],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016211526,0.00054057816,0.0056739193,0.00043615585,0.00014811553,9.0525594e-7,0.007956433,0.0059700008,0.110987425,0.794726,0.005609638,0.067788675],"study_design_scores_gemma":[0.00067559443,0.0000560663,0.0025155342,0.00017416221,0.00004615474,0.000018728846,0.0005141205,0.94509983,0.041412085,0.005904802,0.0032261577,0.00035676843],"about_ca_topic_score_codex":0.0000076651695,"about_ca_topic_score_gemma":8.7122106e-7,"teacher_disagreement_score":0.9391298,"about_ca_system_score_codex":0.00012336465,"about_ca_system_score_gemma":0.00022852716,"threshold_uncertainty_score":0.9999842},"labels":[],"label_agreement":null},{"id":"W4231097844","doi":"10.1109/aspdac.2005.1466550","title":"Register-transfer level functional scan for hierarchical designs","year":2005,"lang":"en","type":"article","venue":"Proceedings of the ASP-DAC 2005. Asia and South Pacific Design Automation Conference, 2005.","topic":"VLSI and Analog Circuit Testing","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Register-transfer level; Scan chain; Design for testing; Computer science; Abstraction; Testability; Transfer (computing); Shift register; High-level synthesis; Register (sociolinguistics); Logic synthesis; Parallel computing; Computer architecture; Logic gate; Embedded system; Reliability engineering; Algorithm; Integrated circuit; Engineering; Field-programmable gate array","score_opus":0.08925124745465288,"score_gpt":0.24746071642811046,"score_spread":0.15820946897345758,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4231097844","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012654434,0.00008640191,0.9744867,0.0030135405,0.00017879234,0.0008503227,0.000029864314,0.000285854,0.008414102],"genre_scores_gemma":[0.96133864,0.000012462423,0.034973998,0.00014308731,0.00021159166,0.00009179523,0.000005640414,0.000023678747,0.0031991357],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997495,0.00005074112,0.000637871,0.00062333595,0.0005726421,0.00062041846],"domain_scores_gemma":[0.9985811,0.00020396154,0.0002836154,0.0002589287,0.0004517896,0.00022056943],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012625294,0.00033123855,0.00038822877,0.0002508683,0.0005069559,0.00042342677,0.00080121,0.00018427511,0.00004374718],"category_scores_gemma":[0.00019903526,0.00026296635,0.00017073372,0.00032198257,0.00022040194,0.00085766,0.00009509282,0.00026568671,0.000018985276],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000097435564,0.0007542061,0.009328759,0.00071957125,0.00041029506,0.0000023304692,0.017464422,0.00091261975,0.08975352,0.5376837,0.04066837,0.30220473],"study_design_scores_gemma":[0.0038182025,0.0004587762,0.028499838,0.0008114267,0.0002478678,0.0001846809,0.002669164,0.8952001,0.02745828,0.02863985,0.010297883,0.0017139298],"about_ca_topic_score_codex":0.0000031970012,"about_ca_topic_score_gemma":0.0000027809688,"teacher_disagreement_score":0.94868416,"about_ca_system_score_codex":0.000069383364,"about_ca_system_score_gemma":0.00031044238,"threshold_uncertainty_score":0.99998224},"labels":[],"label_agreement":null},{"id":"W4234808533","doi":"10.1109/aspdac.2005.1466422","title":"A 10Gb/s transmitter with multi-tap FIR pre-emphasis in 0.18μm CMOS technology","year":2005,"lang":"en","type":"article","venue":"Proceedings of the ASP-DAC 2005. Asia and South Pacific Design Automation Conference, 2005.","topic":"Photonic and Optical Devices","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Retiming; Transmitter; CMOS; Backplane; Current-mode logic; Electronic engineering; Finite impulse response; Emphasis (telecommunications); Electrical engineering; Computer science; Engineering; Channel (broadcasting)","score_opus":0.012031669298268247,"score_gpt":0.20710529379797868,"score_spread":0.19507362449971044,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4234808533","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93812937,0.00094929343,0.025928553,0.0019323617,0.00012798472,0.0023786395,0.00004036286,0.0009823581,0.029531106],"genre_scores_gemma":[0.98302215,0.00011609752,0.01574585,0.00003754671,0.000032353943,0.00020497102,0.0000023428865,0.000039062157,0.00079964584],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99824154,0.00001726369,0.00052360137,0.00036242531,0.00030371876,0.000551474],"domain_scores_gemma":[0.9993634,0.000045405108,0.00015927476,0.00017717476,0.00013155726,0.00012316575],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00036464856,0.00034731056,0.0004436456,0.000344419,0.0001002661,0.00010421178,0.00038035266,0.000289282,0.00011473423],"category_scores_gemma":[0.000037027054,0.00025436076,0.00006747386,0.00043368532,0.00022153444,0.00042989673,0.000035570658,0.00034751603,0.000029862547],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0020450621,0.004524172,0.1994119,0.007515075,0.00312146,0.000049366892,0.11960722,0.028203145,0.25719514,0.061708227,0.015716953,0.30090228],"study_design_scores_gemma":[0.00330134,0.00018071721,0.034538757,0.0007842099,0.00021113009,0.00006431779,0.005778525,0.9049409,0.04224173,0.0007149101,0.006248017,0.0009954565],"about_ca_topic_score_codex":0.0000041530116,"about_ca_topic_score_gemma":0.000015993737,"teacher_disagreement_score":0.8767377,"about_ca_system_score_codex":0.00007024873,"about_ca_system_score_gemma":0.00006849721,"threshold_uncertainty_score":0.9999909},"labels":[],"label_agreement":null},{"id":"W4243129105","doi":"10.1109/aspdac.2005.1466217","title":"Scalable interprocedural register allocation for high level synthesis","year":2005,"lang":"en","type":"article","venue":"Proceedings of the ASP-DAC 2005. Asia and South Pacific Design Automation Conference, 2005.","topic":"Embedded Systems Design Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Register allocation; Speedup; Scalability; Parallel computing; Relation (database); Branch predictor; Theoretical computer science; Programming language; Compiler","score_opus":0.03924881455436664,"score_gpt":0.24645044981976824,"score_spread":0.20720163526540158,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4243129105","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012333405,0.00011833222,0.9720211,0.0050926465,0.00023034737,0.0022905043,0.000032376367,0.0007435486,0.0071377107],"genre_scores_gemma":[0.81118655,0.000017192635,0.18372016,0.00008835478,0.00010145935,0.00041012024,0.00000259307,0.000029600837,0.004443979],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9972078,0.0000742738,0.00087257114,0.000691535,0.00057067844,0.0005831318],"domain_scores_gemma":[0.99758065,0.00021465652,0.0008982252,0.0004463548,0.00072353485,0.0001365837],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0018108336,0.00039271684,0.00052259,0.00033720417,0.00030569854,0.0005386045,0.0012900257,0.00026192373,0.000029076724],"category_scores_gemma":[0.0003880589,0.00031053825,0.00013913782,0.00034002552,0.00017573131,0.0014721516,0.00018335819,0.0001931958,0.000028477576],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032137978,0.00060957397,0.0020770812,0.001702761,0.0004458288,0.0000010439941,0.023258086,0.00013969936,0.124493614,0.60713273,0.15813573,0.08168249],"study_design_scores_gemma":[0.0014586853,0.0003270949,0.0028456042,0.0017589569,0.00022268451,0.000098094184,0.0036189707,0.4743777,0.47611544,0.0329673,0.0047012367,0.0015082485],"about_ca_topic_score_codex":0.000010721443,"about_ca_topic_score_gemma":0.000003633171,"teacher_disagreement_score":0.79885316,"about_ca_system_score_codex":0.00014468486,"about_ca_system_score_gemma":0.0002260712,"threshold_uncertainty_score":0.9999347},"labels":[],"label_agreement":null},{"id":"W4247631688","doi":"10.1109/aspdac.2005.1466116","title":"Leakage power: trends, analysis and avoidance","year":2005,"lang":"en","type":"article","venue":"Proceedings of the ASP-DAC 2005. Asia and South Pacific Design Automation Conference, 2005.","topic":"Low-power high-performance VLSI design","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Leakage (economics); Subthreshold conduction; Leakage power; Electronic engineering; Transistor; Electrical engineering; Scaling; Computer science; Circuit design; Voltage; Engineering; Mathematics","score_opus":0.009213849121891968,"score_gpt":0.19374001573804053,"score_spread":0.18452616661614857,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4247631688","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.87791514,0.0018317363,0.043427724,0.0013732358,0.00042420757,0.0012506063,0.00011273484,0.0015353701,0.07212925],"genre_scores_gemma":[0.98920757,0.00025204738,0.0072116363,0.000028462875,0.000077165314,0.000047557416,0.000006776852,0.00004876929,0.003120021],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99771124,0.000032926306,0.0006728365,0.0004682564,0.0005001864,0.0006145606],"domain_scores_gemma":[0.99895376,0.00006174807,0.00031329232,0.0002739454,0.00018378551,0.00021345963],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00079648814,0.00045160414,0.00061540795,0.00074995356,0.00024226907,0.00027097846,0.0004056697,0.00023202399,0.00026129145],"category_scores_gemma":[0.000047446236,0.00036944525,0.00014943497,0.0009520361,0.00021550602,0.0008379363,0.000068859066,0.0003229662,0.000045779496],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006930733,0.001143105,0.17632034,0.0029119977,0.009941282,0.00001275776,0.115120314,0.033764604,0.27498212,0.034888376,0.14803839,0.20218365],"study_design_scores_gemma":[0.0022799752,0.0001890109,0.10988903,0.00037356577,0.001526046,0.000044922825,0.00562497,0.80937564,0.05602143,0.00061685144,0.012227046,0.0018315259],"about_ca_topic_score_codex":0.0000035838914,"about_ca_topic_score_gemma":0.0000056240824,"teacher_disagreement_score":0.77561104,"about_ca_system_score_codex":0.00008108628,"about_ca_system_score_gemma":0.000049327737,"threshold_uncertainty_score":0.9998757},"labels":[],"label_agreement":null},{"id":"W4250137794","doi":"10.1109/aspdac.2005.1466487","title":"Crossbar based design schemes for switch boxes and programmable interconnection networks","year":2005,"lang":"en","type":"article","venue":"Proceedings of the ASP-DAC 2005. Asia and South Pacific Design Automation Conference, 2005.","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Crossbar switch; Interconnection; Computer science; Routing (electronic design automation); Crossover switch; Field-programmable gate array; Topology (electrical circuits); Network on a chip; Network topology; Parallel computing; Embedded system; Computer architecture; Computer network; Engineering; Electrical engineering; Telecommunications","score_opus":0.025511391140629478,"score_gpt":0.23102644318365506,"score_spread":0.2055150520430256,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4250137794","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0100316135,0.00024283554,0.9850357,0.0012059816,0.0003585997,0.001677825,0.00000485416,0.00030416474,0.001138434],"genre_scores_gemma":[0.9188093,0.000030959785,0.07913025,0.00008651442,0.00020474242,0.0002730612,0.000002718895,0.000025942789,0.0014365249],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976211,0.00008448722,0.0007045172,0.0006376359,0.00034389077,0.0006083568],"domain_scores_gemma":[0.99824065,0.00020191119,0.00061387365,0.00025221976,0.00051982224,0.00017153757],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0019850074,0.00036266338,0.00045378468,0.00023316863,0.00054037175,0.0009943527,0.0005563239,0.0002541984,0.000022672837],"category_scores_gemma":[0.00013100525,0.00028154004,0.00013187576,0.00029322694,0.00016336792,0.0010548467,0.00010930699,0.00022646163,0.00000575868],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001741034,0.001626265,0.01774694,0.0024077715,0.0013457027,0.0000028233494,0.034457527,0.038877346,0.027668063,0.39887002,0.12976083,0.34549567],"study_design_scores_gemma":[0.0009173222,0.00021054236,0.00034401807,0.00027589203,0.00004590071,0.000023799643,0.0009485078,0.9815126,0.006185995,0.0013491478,0.007837099,0.0003491896],"about_ca_topic_score_codex":0.000006349934,"about_ca_topic_score_gemma":0.0000036149531,"teacher_disagreement_score":0.94263524,"about_ca_system_score_codex":0.00006837283,"about_ca_system_score_gemma":0.000121708574,"threshold_uncertainty_score":0.9999637},"labels":[],"label_agreement":null},{"id":"W4255096096","doi":"10.1109/aspdac.2005.1466524","title":"XTW: a parallel and distributed logic simulator","year":2005,"lang":"en","type":"article","venue":"Proceedings of the ASP-DAC 2005. Asia and South Pacific Design Automation Conference, 2005.","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Rollback; Computer science; Queue; Scheduling (production processes); Parallel computing; Schedule; Logic simulation; Distributed computing; Discrete event simulation; Logic gate; Real-time computing; Simulation; Computer network; Algorithm; Operating system; Engineering; Database transaction","score_opus":0.02255839538384482,"score_gpt":0.23686956836543874,"score_spread":0.2143111729815939,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4255096096","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011070982,0.0002523677,0.98054457,0.00268778,0.0000726163,0.00067778456,0.0000148882355,0.0006778666,0.0040011555],"genre_scores_gemma":[0.8409752,0.0000827473,0.15791525,0.00010030372,0.000045726196,0.00002793383,0.000004041428,0.000012812247,0.0008359782],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99801373,0.000059010938,0.0005455024,0.0005266928,0.0004038713,0.00045121674],"domain_scores_gemma":[0.99860317,0.00009405226,0.000517904,0.00026380896,0.0003386752,0.00018241361],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008330579,0.00030815453,0.0003808768,0.0001958124,0.00033448223,0.0004420937,0.0007138398,0.00018222247,0.000022217642],"category_scores_gemma":[0.00014699028,0.00023717633,0.00007661333,0.00034176564,0.00018364876,0.0006667887,0.00025221249,0.00020904066,0.000013279701],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003592444,0.0013809986,0.023710623,0.0008772005,0.00063101226,0.000006774865,0.030339956,0.07723159,0.009825999,0.68411505,0.102694176,0.06882738],"study_design_scores_gemma":[0.0006113579,0.00007685197,0.0029266845,0.00012016037,0.000032364384,0.000021492957,0.00040765456,0.9846091,0.001567986,0.00706264,0.0022021814,0.0003615275],"about_ca_topic_score_codex":0.0000026063722,"about_ca_topic_score_gemma":4.77835e-7,"teacher_disagreement_score":0.9073775,"about_ca_system_score_codex":0.000044175602,"about_ca_system_score_gemma":0.00010989873,"threshold_uncertainty_score":0.967177},"labels":[],"label_agreement":null},{"id":"W4256280318","doi":"10.1109/aspdac.2005.1466203","title":"Integration of supercubing and learning in a SAT solver","year":2005,"lang":"en","type":"article","venue":"Proceedings of the ASP-DAC 2005. Asia and South Pacific Design Automation Conference, 2005.","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Exploit; Solver; Pruning; Computer science; Boolean satisfiability problem; Enhanced Data Rates for GSM Evolution; Point (geometry); Theoretical computer science; Artificial intelligence; Mathematics; Programming language","score_opus":0.03063839314547008,"score_gpt":0.24974613998915138,"score_spread":0.21910774684368128,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4256280318","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5826287,0.00018655305,0.4083432,0.00086768396,0.00012549208,0.00079609157,0.0000032883806,0.00017950484,0.0068694735],"genre_scores_gemma":[0.765839,0.000045453886,0.23369159,0.00001589528,0.0000208278,0.000020268475,0.0000011347586,0.00000867272,0.00035714987],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99827945,0.00011136547,0.00059131114,0.00035847697,0.00036547447,0.00029391603],"domain_scores_gemma":[0.9989436,0.00009687664,0.00046701686,0.0001690635,0.00024874,0.00007469451],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021447812,0.00020066265,0.00030797516,0.00032477922,0.00015450823,0.00017725317,0.00042997196,0.00014419365,0.000014977921],"category_scores_gemma":[0.0003867075,0.00016186765,0.000048185477,0.00037054572,0.0001605491,0.0012616754,0.000127105,0.00030231616,0.000005528458],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014944794,0.0003042846,0.028291421,0.0005075338,0.00008760068,6.196341e-7,0.1032746,0.0009956037,0.3868757,0.24283607,0.0007453691,0.23593175],"study_design_scores_gemma":[0.00065298064,0.00010798139,0.036303468,0.00040464563,0.000029134138,0.00001860243,0.0063684424,0.9015025,0.051311295,0.0025909606,0.00039616114,0.0003138658],"about_ca_topic_score_codex":0.000008646023,"about_ca_topic_score_gemma":0.000003070837,"teacher_disagreement_score":0.90050685,"about_ca_system_score_codex":0.000055567652,"about_ca_system_score_gemma":0.00009205347,"threshold_uncertainty_score":0.6600771},"labels":[],"label_agreement":null}]}