{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:25DULM2PFPFWJIFQOCJ7CEIICU","short_pith_number":"pith:25DULM2P","canonical_record":{"source":{"id":"1804.08680","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-04-23T19:41:44Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"4a4ad593abeb20edfc4e1b1140c3f15c1b77c7359e710800c03b230a1646674c","abstract_canon_sha256":"bf3c6349694abedb7a8940edb6b950bae4fc0699e7fb56c1360472b33d8babf1"},"schema_version":"1.0"},"canonical_sha256":"d74745b34f2bcb64a0b07093f11108152cb2d95507f279bedcc5502dde4e3fa2","source":{"kind":"arxiv","id":"1804.08680","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.08680","created_at":"2026-05-18T00:17:46Z"},{"alias_kind":"arxiv_version","alias_value":"1804.08680v1","created_at":"2026-05-18T00:17:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.08680","created_at":"2026-05-18T00:17:46Z"},{"alias_kind":"pith_short_12","alias_value":"25DULM2PFPFW","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_16","alias_value":"25DULM2PFPFWJIFQ","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_8","alias_value":"25DULM2P","created_at":"2026-05-18T12:31:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:25DULM2PFPFWJIFQOCJ7CEIICU","target":"record","payload":{"canonical_record":{"source":{"id":"1804.08680","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-04-23T19:41:44Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"4a4ad593abeb20edfc4e1b1140c3f15c1b77c7359e710800c03b230a1646674c","abstract_canon_sha256":"bf3c6349694abedb7a8940edb6b950bae4fc0699e7fb56c1360472b33d8babf1"},"schema_version":"1.0"},"canonical_sha256":"d74745b34f2bcb64a0b07093f11108152cb2d95507f279bedcc5502dde4e3fa2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:17:47.000434Z","signature_b64":"WgwPBbsy9m7NpRHMNFjLYrTw0dxRexfs1f2as0NYz7M7qb40ERKBo+EgY5apfUJEh8UpqwqcnVK+0S50sslVBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d74745b34f2bcb64a0b07093f11108152cb2d95507f279bedcc5502dde4e3fa2","last_reissued_at":"2026-05-18T00:17:46.999731Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:17:46.999731Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1804.08680","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:17:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8otR8pTEUlYBYyf7IibmgUow9AuEwIWTe4PbgbF/IzYAiLRIHszRnb6nVF1+buWtCGuCCrHs1aLSj76ttJsNDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T00:16:22.676838Z"},"content_sha256":"719885987b101b559823e5d47ade2154ecd2dc4e7e39205b4b78e9baab3000b3","schema_version":"1.0","event_id":"sha256:719885987b101b559823e5d47ade2154ecd2dc4e7e39205b4b78e9baab3000b3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:25DULM2PFPFWJIFQOCJ7CEIICU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"How to Realize a Graph on Random Points","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Alexander Russell, Saad Quader","submitted_at":"2018-04-23T19:41:44Z","abstract_excerpt":"We are given an integer $d$, a graph $G=(V,E)$, and a uniformly random embedding $f : V \\rightarrow \\{0,1\\}^d$ of the vertices. We are interested in the probability that $G$ can be \"realized\" by a scaled Euclidean norm on $\\mathbb{R}^d$, in the sense that there exists a non-negative scaling $w \\in \\mathbb{R}^d$ and a real threshold $\\theta > 0$ so that \\[\n  (u,v) \\in E \\qquad \\text{if and only if} \\qquad \\Vert f(u) - f(v) \\Vert_w^2 < \\theta\\,, \\] where $\\| x \\|_w^2 = \\sum_i w_i x_i^2$.\n  These constraints are similar to those found in the Euclidean minimum spanning tree (EMST) realization prob"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.08680","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:17:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mFcNNPCgqYrx7Et2q6gIKUzErxk4IxjujXLtTtAWLnkqSJpBQBeh2yr3DSTlwVxjeT3tsLqeU+EniTzJo0X+DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T00:16:22.677583Z"},"content_sha256":"942a81a7b2e146319de9a1e127fb1c73b38718858f1d203147e0ce30c5e8030c","schema_version":"1.0","event_id":"sha256:942a81a7b2e146319de9a1e127fb1c73b38718858f1d203147e0ce30c5e8030c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/25DULM2PFPFWJIFQOCJ7CEIICU/bundle.json","state_url":"https://pith.science/pith/25DULM2PFPFWJIFQOCJ7CEIICU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/25DULM2PFPFWJIFQOCJ7CEIICU/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-05-26T00:16:22Z","links":{"resolver":"https://pith.science/pith/25DULM2PFPFWJIFQOCJ7CEIICU","bundle":"https://pith.science/pith/25DULM2PFPFWJIFQOCJ7CEIICU/bundle.json","state":"https://pith.science/pith/25DULM2PFPFWJIFQOCJ7CEIICU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/25DULM2PFPFWJIFQOCJ7CEIICU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:25DULM2PFPFWJIFQOCJ7CEIICU","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":"bf3c6349694abedb7a8940edb6b950bae4fc0699e7fb56c1360472b33d8babf1","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-04-23T19:41:44Z","title_canon_sha256":"4a4ad593abeb20edfc4e1b1140c3f15c1b77c7359e710800c03b230a1646674c"},"schema_version":"1.0","source":{"id":"1804.08680","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.08680","created_at":"2026-05-18T00:17:46Z"},{"alias_kind":"arxiv_version","alias_value":"1804.08680v1","created_at":"2026-05-18T00:17:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.08680","created_at":"2026-05-18T00:17:46Z"},{"alias_kind":"pith_short_12","alias_value":"25DULM2PFPFW","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_16","alias_value":"25DULM2PFPFWJIFQ","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_8","alias_value":"25DULM2P","created_at":"2026-05-18T12:31:59Z"}],"graph_snapshots":[{"event_id":"sha256:942a81a7b2e146319de9a1e127fb1c73b38718858f1d203147e0ce30c5e8030c","target":"graph","created_at":"2026-05-18T00:17:46Z","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":"We are given an integer $d$, a graph $G=(V,E)$, and a uniformly random embedding $f : V \\rightarrow \\{0,1\\}^d$ of the vertices. We are interested in the probability that $G$ can be \"realized\" by a scaled Euclidean norm on $\\mathbb{R}^d$, in the sense that there exists a non-negative scaling $w \\in \\mathbb{R}^d$ and a real threshold $\\theta > 0$ so that \\[\n  (u,v) \\in E \\qquad \\text{if and only if} \\qquad \\Vert f(u) - f(v) \\Vert_w^2 < \\theta\\,, \\] where $\\| x \\|_w^2 = \\sum_i w_i x_i^2$.\n  These constraints are similar to those found in the Euclidean minimum spanning tree (EMST) realization prob","authors_text":"Alexander Russell, Saad Quader","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-04-23T19:41:44Z","title":"How to Realize a Graph on Random Points"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.08680","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:719885987b101b559823e5d47ade2154ecd2dc4e7e39205b4b78e9baab3000b3","target":"record","created_at":"2026-05-18T00:17:46Z","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":"bf3c6349694abedb7a8940edb6b950bae4fc0699e7fb56c1360472b33d8babf1","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-04-23T19:41:44Z","title_canon_sha256":"4a4ad593abeb20edfc4e1b1140c3f15c1b77c7359e710800c03b230a1646674c"},"schema_version":"1.0","source":{"id":"1804.08680","kind":"arxiv","version":1}},"canonical_sha256":"d74745b34f2bcb64a0b07093f11108152cb2d95507f279bedcc5502dde4e3fa2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d74745b34f2bcb64a0b07093f11108152cb2d95507f279bedcc5502dde4e3fa2","first_computed_at":"2026-05-18T00:17:46.999731Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:17:46.999731Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"WgwPBbsy9m7NpRHMNFjLYrTw0dxRexfs1f2as0NYz7M7qb40ERKBo+EgY5apfUJEh8UpqwqcnVK+0S50sslVBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:17:47.000434Z","signed_message":"canonical_sha256_bytes"},"source_id":"1804.08680","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:719885987b101b559823e5d47ade2154ecd2dc4e7e39205b4b78e9baab3000b3","sha256:942a81a7b2e146319de9a1e127fb1c73b38718858f1d203147e0ce30c5e8030c"],"state_sha256":"3a4c1c63e0ec0cf97c16c0fce933b39aaa6c31820a1c21c273c1de725031e004"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ixsz0x2k1i6xhV8uXiWYCs33Xm3Oo/2moLTmd5S928vRB2BU/fHQi017z6BUjL2gV2+PreqztoPVlOSf45n1Cg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T00:16:22.680627Z","bundle_sha256":"1317d65c07a2d87e24ce8f727570670dcb197a8ed8a63c3aa75705c3d0e87baf"}}