{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:KUN5K7DROLZTGOTVA7V3JVU2VU","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":"444ca98b7ec6684e881a87e4675163fb24a9fc416f89b8ce73f22ab753068b0c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GM","submitted_at":"2017-12-24T09:53:17Z","title_canon_sha256":"1e360b5a102f1e4f0247f260e03aba0e285776abd2eb3f4770a779f18c007af8"},"schema_version":"1.0","source":{"id":"1712.10322","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.10322","created_at":"2026-05-18T00:27:03Z"},{"alias_kind":"arxiv_version","alias_value":"1712.10322v1","created_at":"2026-05-18T00:27:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.10322","created_at":"2026-05-18T00:27:03Z"},{"alias_kind":"pith_short_12","alias_value":"KUN5K7DROLZT","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_16","alias_value":"KUN5K7DROLZTGOTV","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_8","alias_value":"KUN5K7DR","created_at":"2026-05-18T12:31:28Z"}],"graph_snapshots":[{"event_id":"sha256:950657276b098a8121e997d8574121a93c3c654ca9c0743e605f226c32f7d9d6","target":"graph","created_at":"2026-05-18T00:27: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":"The deck of a graph $X$, $D(X)$, is defined as the multiset of all vertex-deleted subgraphs of $X$. Two graphs are said to be hypomorphic, if they have the same deck. Kelly-Ulam conjecture states that any two hypomorphic graphs on at least three vertices are isomorphic. In this paper, we first prove that for two finite simple hypomorphic graphs the number of $l$-paths between two arbitrary vertices are equal, where $1 \\leq l \\leq n - 2$. As a consequence, it is proved that the Kelly-Ulam conjecture is correct over the category of all finite simple graphs.","authors_text":"Adel Tadayyonfar, Ali Reza Ashrafi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GM","submitted_at":"2017-12-24T09:53:17Z","title":"Proof of Kelly-Ulam Conjecture"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.10322","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:34c535af2294c976d7be27ef593707dd88179d6bdae5437f3bc75f1872ef6f18","target":"record","created_at":"2026-05-18T00:27: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":"444ca98b7ec6684e881a87e4675163fb24a9fc416f89b8ce73f22ab753068b0c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GM","submitted_at":"2017-12-24T09:53:17Z","title_canon_sha256":"1e360b5a102f1e4f0247f260e03aba0e285776abd2eb3f4770a779f18c007af8"},"schema_version":"1.0","source":{"id":"1712.10322","kind":"arxiv","version":1}},"canonical_sha256":"551bd57c7172f3333a7507ebb4d69aad0270e0279faff63be99ef2df2ac9eead","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"551bd57c7172f3333a7507ebb4d69aad0270e0279faff63be99ef2df2ac9eead","first_computed_at":"2026-05-18T00:27:03.442746Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:27:03.442746Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ITPCK/4uH+fDDFalkIR9yjpg9enLPQo7NA5MRvmqz0BkDWJbju88tCCLg+Sim+XxFITSzFUQdq+afCm240L6Dw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:27:03.443262Z","signed_message":"canonical_sha256_bytes"},"source_id":"1712.10322","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:34c535af2294c976d7be27ef593707dd88179d6bdae5437f3bc75f1872ef6f18","sha256:950657276b098a8121e997d8574121a93c3c654ca9c0743e605f226c32f7d9d6"],"state_sha256":"9cd756dfa85558309ebfd20bb44b4649ac9b47288b9a6bef8555be192dd8c787"}