{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:AO2PPDUGFQPNYFERRAF76Y7Y5M","short_pith_number":"pith:AO2PPDUG","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"},"canonical_sha256":"03b4f78e862c1edc1491880bff63f8eb0936ae2c1777bfd0966fc99aebeba9a5","source":{"kind":"arxiv","id":"1602.08860","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.08860","created_at":"2026-05-18T00:39:03Z"},{"alias_kind":"arxiv_version","alias_value":"1602.08860v1","created_at":"2026-05-18T00:39:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.08860","created_at":"2026-05-18T00:39:03Z"},{"alias_kind":"pith_short_12","alias_value":"AO2PPDUGFQPN","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_16","alias_value":"AO2PPDUGFQPNYFER","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_8","alias_value":"AO2PPDUG","created_at":"2026-05-18T12:30:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:AO2PPDUGFQPNYFERRAF76Y7Y5M","target":"record","payload":{"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"},"canonical_sha256":"03b4f78e862c1edc1491880bff63f8eb0936ae2c1777bfd0966fc99aebeba9a5","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"},"source_kind":"arxiv","source_id":"1602.08860","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:39:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1r4VYAF/9o8hVnzObfhjpbVSlPwpfIOutafyp5zXi92iSEFq67rCfiNL2xsz9g+dvSeOTbW5lfBJct92LLFDDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T23:10:11.290366Z"},"content_sha256":"fc8dcb5a62121f3b80b90a1b66bf6460a4b3ffc95e0698ee5406699289958212","schema_version":"1.0","event_id":"sha256:fc8dcb5a62121f3b80b90a1b66bf6460a4b3ffc95e0698ee5406699289958212"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:AO2PPDUGFQPNYFERRAF76Y7Y5M","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:39:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6a5IPj6daF5LhOk91f7s5x7+NJ0NaoEOezlYDWNhKxK3KFuoBh9uTkGlq50G73ToL3o7fOX0y71vA0BPZS4qAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T23:10:11.290712Z"},"content_sha256":"e503459f3c08befba4b231a1d9e0d5232ca32d54acd1c571747035146d9e957e","schema_version":"1.0","event_id":"sha256:e503459f3c08befba4b231a1d9e0d5232ca32d54acd1c571747035146d9e957e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AO2PPDUGFQPNYFERRAF76Y7Y5M/bundle.json","state_url":"https://pith.science/pith/AO2PPDUGFQPNYFERRAF76Y7Y5M/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AO2PPDUGFQPNYFERRAF76Y7Y5M/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-08T23:10:11Z","links":{"resolver":"https://pith.science/pith/AO2PPDUGFQPNYFERRAF76Y7Y5M","bundle":"https://pith.science/pith/AO2PPDUGFQPNYFERRAF76Y7Y5M/bundle.json","state":"https://pith.science/pith/AO2PPDUGFQPNYFERRAF76Y7Y5M/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AO2PPDUGFQPNYFERRAF76Y7Y5M/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:AO2PPDUGFQPNYFERRAF76Y7Y5M","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"aadcaa8afa8e599afe3b53a72dba41f541f1b6550d75714b62d0c8eb87626643","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2016-02-29T08:42:09Z","title_canon_sha256":"d04ea9c37391fccbd74147e94036bf26c5c81416f1cd3129ee1721b15bb74ccb"},"schema_version":"1.0","source":{"id":"1602.08860","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.08860","created_at":"2026-05-18T00:39:03Z"},{"alias_kind":"arxiv_version","alias_value":"1602.08860v1","created_at":"2026-05-18T00:39:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.08860","created_at":"2026-05-18T00:39:03Z"},{"alias_kind":"pith_short_12","alias_value":"AO2PPDUGFQPN","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_16","alias_value":"AO2PPDUGFQPNYFER","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_8","alias_value":"AO2PPDUG","created_at":"2026-05-18T12:30:07Z"}],"graph_snapshots":[{"event_id":"sha256:e503459f3c08befba4b231a1d9e0d5232ca32d54acd1c571747035146d9e957e","target":"graph","created_at":"2026-05-18T00:39:03Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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 ","authors_text":"Ali Zaghian, Mahdi Davoudi Darareh, Sayed Mohammad Hosseini, Shahrooz Janbaz","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2016-02-29T08:42:09Z","title":"An Adiabatic Quantum Algorithm for Determining Gracefulness of A Graph"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.08860","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:fc8dcb5a62121f3b80b90a1b66bf6460a4b3ffc95e0698ee5406699289958212","target":"record","created_at":"2026-05-18T00:39:03Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"aadcaa8afa8e599afe3b53a72dba41f541f1b6550d75714b62d0c8eb87626643","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2016-02-29T08:42:09Z","title_canon_sha256":"d04ea9c37391fccbd74147e94036bf26c5c81416f1cd3129ee1721b15bb74ccb"},"schema_version":"1.0","source":{"id":"1602.08860","kind":"arxiv","version":1}},"canonical_sha256":"03b4f78e862c1edc1491880bff63f8eb0936ae2c1777bfd0966fc99aebeba9a5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"03b4f78e862c1edc1491880bff63f8eb0936ae2c1777bfd0966fc99aebeba9a5","first_computed_at":"2026-05-18T00:39:03.108032Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:39:03.108032Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"IM6M3BiBo8MqE4soihLpCEp7urLrSZ3jThwnrjQxV0uD3oGg+cMJlsL94strs+UEfn8aPlLIR7x7VzeR1J65Ag==","signature_status":"signed_v1","signed_at":"2026-05-18T00:39:03.108744Z","signed_message":"canonical_sha256_bytes"},"source_id":"1602.08860","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fc8dcb5a62121f3b80b90a1b66bf6460a4b3ffc95e0698ee5406699289958212","sha256:e503459f3c08befba4b231a1d9e0d5232ca32d54acd1c571747035146d9e957e"],"state_sha256":"232e4ac4db2d7c6ca2675e2e7836031406874d81a8e86adbaa8424b19d4c1995"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JDZYUWAmolgmTjMSllftssPJCu0DK6fpH/qsc4fA0Zy34aN+WQtDEbMSHtHLa5yTOwtvNCBTRBw7ZIn8vvpMBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T23:10:11.292577Z","bundle_sha256":"d741c633f9b2e21fcfc99fa5db99b77c95fca61be1cbe8ed7d10d75a8a47304d"}}