{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:OD77N4DHBQXHUP3VUWOGZ6WZP5","short_pith_number":"pith:OD77N4DH","schema_version":"1.0","canonical_sha256":"70fff6f0670c2e7a3f75a59c6cfad97f4dc4c08161a5b7d21c23f9332258a184","source":{"kind":"arxiv","id":"2004.03819","version":1},"attestation_state":"computed","paper":{"title":"Minor-embedding heuristics for large-scale annealing processors with sparse hardware graphs of up to 102,400 nodes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.ET"],"primary_cat":"quant-ph","authors_text":"Atsuyoshi Nakamura, Hiroshi Teramoto, Ichigaku Takigawa, Masanao Yamaoka, Normann Mertig, Shin-ichi Minato, Takashi Takemoto, Tamiki Komatsuzaki, Yuki Yoshida, Yuya Sugie","submitted_at":"2020-04-08T05:30:43Z","abstract_excerpt":"Minor embedding heuristics have become an indispensable tool for compiling problems in quadratically unconstrained binary optimization (QUBO) into the hardware graphs of quantum and CMOS annealing processors. While recent embedding heuristics have been developed for annealers of moderate size (about 2000 nodes) the size of the latest CMOS annealing processor (with 102,400 nodes) poses entirely new demands on the embedding heuristic. This raises the question, if recent embedding heuristics can maintain meaningful embedding performance on hardware graphs of increasing size. Here, we develop an i"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2004.03819","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2020-04-08T05:30:43Z","cross_cats_sorted":["cs.ET"],"title_canon_sha256":"90d9434f5f5f3d70a6bcf4bb54afab219656feb8f1a7b8f1d9e1fd8bb35afd8b","abstract_canon_sha256":"2bf68a820b850f85df406279ff28d1ddabcec0cbe93488b8bd6a5cd7b720be45"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:53:56.645624Z","signature_b64":"dVVDPUP1Y7Wo1uZeiGljzk0QMjLBJVS5X+WOwGV2/iE7/aEp4u7H/gZjFO7uFeKfaZV9fNrpFcyLK+BbNkkaCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"70fff6f0670c2e7a3f75a59c6cfad97f4dc4c08161a5b7d21c23f9332258a184","last_reissued_at":"2026-07-05T00:53:56.645103Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:53:56.645103Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Minor-embedding heuristics for large-scale annealing processors with sparse hardware graphs of up to 102,400 nodes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.ET"],"primary_cat":"quant-ph","authors_text":"Atsuyoshi Nakamura, Hiroshi Teramoto, Ichigaku Takigawa, Masanao Yamaoka, Normann Mertig, Shin-ichi Minato, Takashi Takemoto, Tamiki Komatsuzaki, Yuki Yoshida, Yuya Sugie","submitted_at":"2020-04-08T05:30:43Z","abstract_excerpt":"Minor embedding heuristics have become an indispensable tool for compiling problems in quadratically unconstrained binary optimization (QUBO) into the hardware graphs of quantum and CMOS annealing processors. While recent embedding heuristics have been developed for annealers of moderate size (about 2000 nodes) the size of the latest CMOS annealing processor (with 102,400 nodes) poses entirely new demands on the embedding heuristic. This raises the question, if recent embedding heuristics can maintain meaningful embedding performance on hardware graphs of increasing size. Here, we develop an i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2004.03819","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2004.03819/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2004.03819","created_at":"2026-07-05T00:53:56.645167+00:00"},{"alias_kind":"arxiv_version","alias_value":"2004.03819v1","created_at":"2026-07-05T00:53:56.645167+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2004.03819","created_at":"2026-07-05T00:53:56.645167+00:00"},{"alias_kind":"pith_short_12","alias_value":"OD77N4DHBQXH","created_at":"2026-07-05T00:53:56.645167+00:00"},{"alias_kind":"pith_short_16","alias_value":"OD77N4DHBQXHUP3V","created_at":"2026-07-05T00:53:56.645167+00:00"},{"alias_kind":"pith_short_8","alias_value":"OD77N4DH","created_at":"2026-07-05T00:53:56.645167+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/OD77N4DHBQXHUP3VUWOGZ6WZP5","json":"https://pith.science/pith/OD77N4DHBQXHUP3VUWOGZ6WZP5.json","graph_json":"https://pith.science/api/pith-number/OD77N4DHBQXHUP3VUWOGZ6WZP5/graph.json","events_json":"https://pith.science/api/pith-number/OD77N4DHBQXHUP3VUWOGZ6WZP5/events.json","paper":"https://pith.science/paper/OD77N4DH"},"agent_actions":{"view_html":"https://pith.science/pith/OD77N4DHBQXHUP3VUWOGZ6WZP5","download_json":"https://pith.science/pith/OD77N4DHBQXHUP3VUWOGZ6WZP5.json","view_paper":"https://pith.science/paper/OD77N4DH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2004.03819&json=true","fetch_graph":"https://pith.science/api/pith-number/OD77N4DHBQXHUP3VUWOGZ6WZP5/graph.json","fetch_events":"https://pith.science/api/pith-number/OD77N4DHBQXHUP3VUWOGZ6WZP5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OD77N4DHBQXHUP3VUWOGZ6WZP5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OD77N4DHBQXHUP3VUWOGZ6WZP5/action/storage_attestation","attest_author":"https://pith.science/pith/OD77N4DHBQXHUP3VUWOGZ6WZP5/action/author_attestation","sign_citation":"https://pith.science/pith/OD77N4DHBQXHUP3VUWOGZ6WZP5/action/citation_signature","submit_replication":"https://pith.science/pith/OD77N4DHBQXHUP3VUWOGZ6WZP5/action/replication_record"}},"created_at":"2026-07-05T00:53:56.645167+00:00","updated_at":"2026-07-05T00:53:56.645167+00:00"}