{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:AO2PPDUGFQPNYFERRAF76Y7Y5M","short_pith_number":"pith:AO2PPDUG","schema_version":"1.0","canonical_sha256":"03b4f78e862c1edc1491880bff63f8eb0936ae2c1777bfd0966fc99aebeba9a5","source":{"kind":"arxiv","id":"1602.08860","version":1},"attestation_state":"computed","paper":{"title":"An Adiabatic Quantum Algorithm for Determining Gracefulness of A Graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Ali Zaghian, Mahdi Davoudi Darareh, Sayed Mohammad Hosseini, Shahrooz Janbaz","submitted_at":"2016-02-29T08:42:09Z","abstract_excerpt":"Graph labelling is one of the noticed contexts in combinatorics and graph theory. Graceful labelling for a graph $G$ with $e$ edges, is to label the vertices of $G$ with $0, 1, \\cdots, e$ such that, if we specify to each edge the difference value between its two ends, then any of $1, 2, \\cdots, e$ appears exactly once as an edge label. For a given graph, there is still few efficient classical algorithms that determines either it is graceful or not, even for trees - as a well-known class of graphs. In this paper, we introduce an adiabatic quantum algorithm, which for a graceful graph $G$ finds "},"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":"1602.08860","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2016-02-29T08:42:09Z","cross_cats_sorted":[],"title_canon_sha256":"d04ea9c37391fccbd74147e94036bf26c5c81416f1cd3129ee1721b15bb74ccb","abstract_canon_sha256":"aadcaa8afa8e599afe3b53a72dba41f541f1b6550d75714b62d0c8eb87626643"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:39:03.108744Z","signature_b64":"IM6M3BiBo8MqE4soihLpCEp7urLrSZ3jThwnrjQxV0uD3oGg+cMJlsL94strs+UEfn8aPlLIR7x7VzeR1J65Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"03b4f78e862c1edc1491880bff63f8eb0936ae2c1777bfd0966fc99aebeba9a5","last_reissued_at":"2026-05-18T00:39:03.108032Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:39:03.108032Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Adiabatic Quantum Algorithm for Determining Gracefulness of A Graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Ali Zaghian, Mahdi Davoudi Darareh, Sayed Mohammad Hosseini, Shahrooz Janbaz","submitted_at":"2016-02-29T08:42:09Z","abstract_excerpt":"Graph labelling is one of the noticed contexts in combinatorics and graph theory. Graceful labelling for a graph $G$ with $e$ edges, is to label the vertices of $G$ with $0, 1, \\cdots, e$ such that, if we specify to each edge the difference value between its two ends, then any of $1, 2, \\cdots, e$ appears exactly once as an edge label. For a given graph, there is still few efficient classical algorithms that determines either it is graceful or not, even for trees - as a well-known class of graphs. In this paper, we introduce an adiabatic quantum algorithm, which for a graceful graph $G$ finds "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.08860","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":""},"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":"1602.08860","created_at":"2026-05-18T00:39:03.108136+00:00"},{"alias_kind":"arxiv_version","alias_value":"1602.08860v1","created_at":"2026-05-18T00:39:03.108136+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.08860","created_at":"2026-05-18T00:39:03.108136+00:00"},{"alias_kind":"pith_short_12","alias_value":"AO2PPDUGFQPN","created_at":"2026-05-18T12:30:07.202191+00:00"},{"alias_kind":"pith_short_16","alias_value":"AO2PPDUGFQPNYFER","created_at":"2026-05-18T12:30:07.202191+00:00"},{"alias_kind":"pith_short_8","alias_value":"AO2PPDUG","created_at":"2026-05-18T12:30:07.202191+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/AO2PPDUGFQPNYFERRAF76Y7Y5M","json":"https://pith.science/pith/AO2PPDUGFQPNYFERRAF76Y7Y5M.json","graph_json":"https://pith.science/api/pith-number/AO2PPDUGFQPNYFERRAF76Y7Y5M/graph.json","events_json":"https://pith.science/api/pith-number/AO2PPDUGFQPNYFERRAF76Y7Y5M/events.json","paper":"https://pith.science/paper/AO2PPDUG"},"agent_actions":{"view_html":"https://pith.science/pith/AO2PPDUGFQPNYFERRAF76Y7Y5M","download_json":"https://pith.science/pith/AO2PPDUGFQPNYFERRAF76Y7Y5M.json","view_paper":"https://pith.science/paper/AO2PPDUG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1602.08860&json=true","fetch_graph":"https://pith.science/api/pith-number/AO2PPDUGFQPNYFERRAF76Y7Y5M/graph.json","fetch_events":"https://pith.science/api/pith-number/AO2PPDUGFQPNYFERRAF76Y7Y5M/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AO2PPDUGFQPNYFERRAF76Y7Y5M/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AO2PPDUGFQPNYFERRAF76Y7Y5M/action/storage_attestation","attest_author":"https://pith.science/pith/AO2PPDUGFQPNYFERRAF76Y7Y5M/action/author_attestation","sign_citation":"https://pith.science/pith/AO2PPDUGFQPNYFERRAF76Y7Y5M/action/citation_signature","submit_replication":"https://pith.science/pith/AO2PPDUGFQPNYFERRAF76Y7Y5M/action/replication_record"}},"created_at":"2026-05-18T00:39:03.108136+00:00","updated_at":"2026-05-18T00:39:03.108136+00:00"}