{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:UNPHYMOO5T4ZSP7ZFMUUSKUCVH","short_pith_number":"pith:UNPHYMOO","canonical_record":{"source":{"id":"2605.18487","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-05-18T14:39:31Z","cross_cats_sorted":[],"title_canon_sha256":"f33fea2ab2139f67cc21462cddf6e988889100ee4c99906d9cec835bf42caaa1","abstract_canon_sha256":"0ef350d45388bfda83ca8b6ec6a81b0550ead1f0bdf8bbce6bd320faf1a545ea"},"schema_version":"1.0"},"canonical_sha256":"a35e7c31ceecf9993ff92b29492a82a9f4cb9a05a91e791a606a78587fdbbdf5","source":{"kind":"arxiv","id":"2605.18487","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.18487","created_at":"2026-05-20T00:06:03Z"},{"alias_kind":"arxiv_version","alias_value":"2605.18487v1","created_at":"2026-05-20T00:06:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.18487","created_at":"2026-05-20T00:06:03Z"},{"alias_kind":"pith_short_12","alias_value":"UNPHYMOO5T4Z","created_at":"2026-05-20T00:06:03Z"},{"alias_kind":"pith_short_16","alias_value":"UNPHYMOO5T4ZSP7Z","created_at":"2026-05-20T00:06:03Z"},{"alias_kind":"pith_short_8","alias_value":"UNPHYMOO","created_at":"2026-05-20T00:06:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:UNPHYMOO5T4ZSP7ZFMUUSKUCVH","target":"record","payload":{"canonical_record":{"source":{"id":"2605.18487","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-05-18T14:39:31Z","cross_cats_sorted":[],"title_canon_sha256":"f33fea2ab2139f67cc21462cddf6e988889100ee4c99906d9cec835bf42caaa1","abstract_canon_sha256":"0ef350d45388bfda83ca8b6ec6a81b0550ead1f0bdf8bbce6bd320faf1a545ea"},"schema_version":"1.0"},"canonical_sha256":"a35e7c31ceecf9993ff92b29492a82a9f4cb9a05a91e791a606a78587fdbbdf5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:06:03.816555Z","signature_b64":"kWh755VBiWaH742/Q1gHx1iYkweYOnI6zlVGowkjwoOE+mkH3Z9tVLQT32WZ1z+uxiJNb6EOi4Oaa7hNsnaVDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a35e7c31ceecf9993ff92b29492a82a9f4cb9a05a91e791a606a78587fdbbdf5","last_reissued_at":"2026-05-20T00:06:03.815989Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:06:03.815989Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.18487","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-20T00:06:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fAG6MmblNIsB+djh49nmF46vk47mFukv7gv46+qBZtpE4HgGNdczQQ5jC+5EFM5AE7GDuA4zPw5IoWQRXfH8Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T02:33:26.576127Z"},"content_sha256":"281166bed4b74f13bb07626f0f030889d331fdd536b17f92dfe3a716c61bdf80","schema_version":"1.0","event_id":"sha256:281166bed4b74f13bb07626f0f030889d331fdd536b17f92dfe3a716c61bdf80"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:UNPHYMOO5T4ZSP7ZFMUUSKUCVH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The number of realisations of a random graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Anthony Nixon, Ben Smith, Sean Dewar","submitted_at":"2026-05-18T14:39:31Z","abstract_excerpt":"Determining the number of realisations of a graph for a specific choice of edge lengths is a fundamental problem in discrete geometry. In this article we prove that the $d$-dimensional realisation number of an Erd\\H{o}s-Renyi random graph is either infinity or a power of 2 with exponent computable in polynomial time. We also determine a similar formula for the number of complex solutions to the generic rank-$d$ PSD matrix completion problem with randomly-selected non-diagonal unknown entries."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.18487","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/2605.18487/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"},"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-20T00:06:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eh4zQ/SDziLu/QaObNfEhAZ3vJ06+aPyBRScXx/aooubC9ZsoCyuoBjbtzJegAaNHv3FElbbqn1vMVZV8wkIBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T02:33:26.576520Z"},"content_sha256":"214d95187580c157e12d512d3e5267abf0699575a5dda43d4f2cd965a3b034c9","schema_version":"1.0","event_id":"sha256:214d95187580c157e12d512d3e5267abf0699575a5dda43d4f2cd965a3b034c9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UNPHYMOO5T4ZSP7ZFMUUSKUCVH/bundle.json","state_url":"https://pith.science/pith/UNPHYMOO5T4ZSP7ZFMUUSKUCVH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UNPHYMOO5T4ZSP7ZFMUUSKUCVH/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-02T02:33:26Z","links":{"resolver":"https://pith.science/pith/UNPHYMOO5T4ZSP7ZFMUUSKUCVH","bundle":"https://pith.science/pith/UNPHYMOO5T4ZSP7ZFMUUSKUCVH/bundle.json","state":"https://pith.science/pith/UNPHYMOO5T4ZSP7ZFMUUSKUCVH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UNPHYMOO5T4ZSP7ZFMUUSKUCVH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:UNPHYMOO5T4ZSP7ZFMUUSKUCVH","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":"0ef350d45388bfda83ca8b6ec6a81b0550ead1f0bdf8bbce6bd320faf1a545ea","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-05-18T14:39:31Z","title_canon_sha256":"f33fea2ab2139f67cc21462cddf6e988889100ee4c99906d9cec835bf42caaa1"},"schema_version":"1.0","source":{"id":"2605.18487","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.18487","created_at":"2026-05-20T00:06:03Z"},{"alias_kind":"arxiv_version","alias_value":"2605.18487v1","created_at":"2026-05-20T00:06:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.18487","created_at":"2026-05-20T00:06:03Z"},{"alias_kind":"pith_short_12","alias_value":"UNPHYMOO5T4Z","created_at":"2026-05-20T00:06:03Z"},{"alias_kind":"pith_short_16","alias_value":"UNPHYMOO5T4ZSP7Z","created_at":"2026-05-20T00:06:03Z"},{"alias_kind":"pith_short_8","alias_value":"UNPHYMOO","created_at":"2026-05-20T00:06:03Z"}],"graph_snapshots":[{"event_id":"sha256:214d95187580c157e12d512d3e5267abf0699575a5dda43d4f2cd965a3b034c9","target":"graph","created_at":"2026-05-20T00:06: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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2605.18487/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Determining the number of realisations of a graph for a specific choice of edge lengths is a fundamental problem in discrete geometry. In this article we prove that the $d$-dimensional realisation number of an Erd\\H{o}s-Renyi random graph is either infinity or a power of 2 with exponent computable in polynomial time. We also determine a similar formula for the number of complex solutions to the generic rank-$d$ PSD matrix completion problem with randomly-selected non-diagonal unknown entries.","authors_text":"Anthony Nixon, Ben Smith, Sean Dewar","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-05-18T14:39:31Z","title":"The number of realisations of a random graph"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.18487","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:281166bed4b74f13bb07626f0f030889d331fdd536b17f92dfe3a716c61bdf80","target":"record","created_at":"2026-05-20T00:06: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":"0ef350d45388bfda83ca8b6ec6a81b0550ead1f0bdf8bbce6bd320faf1a545ea","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-05-18T14:39:31Z","title_canon_sha256":"f33fea2ab2139f67cc21462cddf6e988889100ee4c99906d9cec835bf42caaa1"},"schema_version":"1.0","source":{"id":"2605.18487","kind":"arxiv","version":1}},"canonical_sha256":"a35e7c31ceecf9993ff92b29492a82a9f4cb9a05a91e791a606a78587fdbbdf5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a35e7c31ceecf9993ff92b29492a82a9f4cb9a05a91e791a606a78587fdbbdf5","first_computed_at":"2026-05-20T00:06:03.815989Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-20T00:06:03.815989Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kWh755VBiWaH742/Q1gHx1iYkweYOnI6zlVGowkjwoOE+mkH3Z9tVLQT32WZ1z+uxiJNb6EOi4Oaa7hNsnaVDA==","signature_status":"signed_v1","signed_at":"2026-05-20T00:06:03.816555Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.18487","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:281166bed4b74f13bb07626f0f030889d331fdd536b17f92dfe3a716c61bdf80","sha256:214d95187580c157e12d512d3e5267abf0699575a5dda43d4f2cd965a3b034c9"],"state_sha256":"b6d5fb73f4dcff6dbaf57723b8d71b9381ffa94ac66fbdd20b1e8e204a815d19"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kk3LpFRfiCdw6ppdcwaouXC7P3MrIUirRvBl4fZCX2EolOJMiZId+mbJRTXIlZDLBgo6oC9Bb1mUAqyKyyb/Aw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T02:33:26.578665Z","bundle_sha256":"14e894b726125117ac2cac698acc16b82ceb361b9b31c7bac163587248bca940"}}