{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:GJPD7AKTJBWP57G3SA22FFLP5R","short_pith_number":"pith:GJPD7AKT","canonical_record":{"source":{"id":"1301.4121","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-01-17T15:25:55Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"d9f7348a5f4ea0cf66edd0de40361b208d02061398fc945354173b6b8cea6214","abstract_canon_sha256":"d172659dc7525b57f8ae622e3bad860b415a9499436775f391d8b0c4ae9cfb26"},"schema_version":"1.0"},"canonical_sha256":"325e3f8153486cfefcdb9035a2956fec4f6df24b490488adacd0c2cc4ff02f68","source":{"kind":"arxiv","id":"1301.4121","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.4121","created_at":"2026-05-18T02:43:24Z"},{"alias_kind":"arxiv_version","alias_value":"1301.4121v2","created_at":"2026-05-18T02:43:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.4121","created_at":"2026-05-18T02:43:24Z"},{"alias_kind":"pith_short_12","alias_value":"GJPD7AKTJBWP","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_16","alias_value":"GJPD7AKTJBWP57G3","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_8","alias_value":"GJPD7AKT","created_at":"2026-05-18T12:27:45Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:GJPD7AKTJBWP57G3SA22FFLP5R","target":"record","payload":{"canonical_record":{"source":{"id":"1301.4121","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-01-17T15:25:55Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"d9f7348a5f4ea0cf66edd0de40361b208d02061398fc945354173b6b8cea6214","abstract_canon_sha256":"d172659dc7525b57f8ae622e3bad860b415a9499436775f391d8b0c4ae9cfb26"},"schema_version":"1.0"},"canonical_sha256":"325e3f8153486cfefcdb9035a2956fec4f6df24b490488adacd0c2cc4ff02f68","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:43:24.494232Z","signature_b64":"RDb0mvZqYeNICc6vs5qOIWFKB59DtChwgR7BeIbZAwbc/+Xsuv16cKPCy6gaq8ujIyFjga6S0uWjGZNQTZFkDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"325e3f8153486cfefcdb9035a2956fec4f6df24b490488adacd0c2cc4ff02f68","last_reissued_at":"2026-05-18T02:43:24.493736Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:43:24.493736Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1301.4121","source_version":2,"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-18T02:43:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WXgWvBuW34E49SXHKII3QIAjnhnmFu3Gpe9hzOMstrS1MNU+9/gVkoaO/+pwyCYxU81aw6NAg5lFvSxwl1ZoCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T16:40:21.731910Z"},"content_sha256":"6e6a5743a2ced6afb8236bd810de2281ce3d4c4bf2132cfdb94779f379744315","schema_version":"1.0","event_id":"sha256:6e6a5743a2ced6afb8236bd810de2281ce3d4c4bf2132cfdb94779f379744315"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:GJPD7AKTJBWP57G3SA22FFLP5R","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An algebraic formulation of the graph reconstruction conjecture","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Bhalchandra D. Thatte, Igor C. Oliveira","submitted_at":"2013-01-17T15:25:55Z","abstract_excerpt":"The graph reconstruction conjecture asserts that every finite simple graph on at least three vertices can be reconstructed up to isomorphism from its deck - the collection of its vertex-deleted subgraphs. Kocay's Lemma is an important tool in graph reconstruction. Roughly speaking, given the deck of a graph $G$ and any finite sequence of graphs, it gives a linear constraint that every reconstruction of $G$ must satisfy.\n  Let $\\psi(n)$ be the number of distinct (mutually non-isomorphic) graphs on $n$ vertices, and let $d(n)$ be the number of distinct decks that can be constructed from these gr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.4121","kind":"arxiv","version":2},"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-18T02:43:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uMqdYyLjkgn4S98yJMp2XgmhL5ab56x9vHmnl45a7kRuV3jUc+B+wG+tQzj1XdyIbs8u/ZfF4Wyz9v1xfgcXCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T16:40:21.732528Z"},"content_sha256":"9b6151d3d7af7304aa9987594a210eb529a10d67e53744ac2dbfa8d430f54008","schema_version":"1.0","event_id":"sha256:9b6151d3d7af7304aa9987594a210eb529a10d67e53744ac2dbfa8d430f54008"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GJPD7AKTJBWP57G3SA22FFLP5R/bundle.json","state_url":"https://pith.science/pith/GJPD7AKTJBWP57G3SA22FFLP5R/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GJPD7AKTJBWP57G3SA22FFLP5R/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-07T16:40:21Z","links":{"resolver":"https://pith.science/pith/GJPD7AKTJBWP57G3SA22FFLP5R","bundle":"https://pith.science/pith/GJPD7AKTJBWP57G3SA22FFLP5R/bundle.json","state":"https://pith.science/pith/GJPD7AKTJBWP57G3SA22FFLP5R/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GJPD7AKTJBWP57G3SA22FFLP5R/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:GJPD7AKTJBWP57G3SA22FFLP5R","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":"d172659dc7525b57f8ae622e3bad860b415a9499436775f391d8b0c4ae9cfb26","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-01-17T15:25:55Z","title_canon_sha256":"d9f7348a5f4ea0cf66edd0de40361b208d02061398fc945354173b6b8cea6214"},"schema_version":"1.0","source":{"id":"1301.4121","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.4121","created_at":"2026-05-18T02:43:24Z"},{"alias_kind":"arxiv_version","alias_value":"1301.4121v2","created_at":"2026-05-18T02:43:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.4121","created_at":"2026-05-18T02:43:24Z"},{"alias_kind":"pith_short_12","alias_value":"GJPD7AKTJBWP","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_16","alias_value":"GJPD7AKTJBWP57G3","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_8","alias_value":"GJPD7AKT","created_at":"2026-05-18T12:27:45Z"}],"graph_snapshots":[{"event_id":"sha256:9b6151d3d7af7304aa9987594a210eb529a10d67e53744ac2dbfa8d430f54008","target":"graph","created_at":"2026-05-18T02:43:24Z","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 graph reconstruction conjecture asserts that every finite simple graph on at least three vertices can be reconstructed up to isomorphism from its deck - the collection of its vertex-deleted subgraphs. Kocay's Lemma is an important tool in graph reconstruction. Roughly speaking, given the deck of a graph $G$ and any finite sequence of graphs, it gives a linear constraint that every reconstruction of $G$ must satisfy.\n  Let $\\psi(n)$ be the number of distinct (mutually non-isomorphic) graphs on $n$ vertices, and let $d(n)$ be the number of distinct decks that can be constructed from these gr","authors_text":"Bhalchandra D. Thatte, Igor C. Oliveira","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-01-17T15:25:55Z","title":"An algebraic formulation of the graph reconstruction conjecture"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.4121","kind":"arxiv","version":2},"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:6e6a5743a2ced6afb8236bd810de2281ce3d4c4bf2132cfdb94779f379744315","target":"record","created_at":"2026-05-18T02:43:24Z","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":"d172659dc7525b57f8ae622e3bad860b415a9499436775f391d8b0c4ae9cfb26","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-01-17T15:25:55Z","title_canon_sha256":"d9f7348a5f4ea0cf66edd0de40361b208d02061398fc945354173b6b8cea6214"},"schema_version":"1.0","source":{"id":"1301.4121","kind":"arxiv","version":2}},"canonical_sha256":"325e3f8153486cfefcdb9035a2956fec4f6df24b490488adacd0c2cc4ff02f68","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"325e3f8153486cfefcdb9035a2956fec4f6df24b490488adacd0c2cc4ff02f68","first_computed_at":"2026-05-18T02:43:24.493736Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:43:24.493736Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"RDb0mvZqYeNICc6vs5qOIWFKB59DtChwgR7BeIbZAwbc/+Xsuv16cKPCy6gaq8ujIyFjga6S0uWjGZNQTZFkDA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:43:24.494232Z","signed_message":"canonical_sha256_bytes"},"source_id":"1301.4121","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6e6a5743a2ced6afb8236bd810de2281ce3d4c4bf2132cfdb94779f379744315","sha256:9b6151d3d7af7304aa9987594a210eb529a10d67e53744ac2dbfa8d430f54008"],"state_sha256":"050422cc521e05fe2bcf80d5bf508452cba74e4161a9c24a2fc717ee43cced06"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KhXqYxb/1ODiWgmbS5rxjOEvtcweleSdYCPdFjdgntj4TEb6qHWJ6pytn5vn3qpqba+2BM6kEDMbsSMiLuX2Cg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T16:40:21.736226Z","bundle_sha256":"8886aa1acdce4ce8fa52c50373c7d4c0d04445158cf765f079d4202e2559da05"}}