{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:25DULM2PFPFWJIFQOCJ7CEIICU","short_pith_number":"pith:25DULM2P","schema_version":"1.0","canonical_sha256":"d74745b34f2bcb64a0b07093f11108152cb2d95507f279bedcc5502dde4e3fa2","source":{"kind":"arxiv","id":"1804.08680","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1804.08680","created_at":"2026-05-18T00:17:46.999842+00:00"},{"alias_kind":"arxiv_version","alias_value":"1804.08680v1","created_at":"2026-05-18T00:17:46.999842+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.08680","created_at":"2026-05-18T00:17:46.999842+00:00"},{"alias_kind":"pith_short_12","alias_value":"25DULM2PFPFW","created_at":"2026-05-18T12:31:59.375834+00:00"},{"alias_kind":"pith_short_16","alias_value":"25DULM2PFPFWJIFQ","created_at":"2026-05-18T12:31:59.375834+00:00"},{"alias_kind":"pith_short_8","alias_value":"25DULM2P","created_at":"2026-05-18T12:31:59.375834+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/25DULM2PFPFWJIFQOCJ7CEIICU","json":"https://pith.science/pith/25DULM2PFPFWJIFQOCJ7CEIICU.json","graph_json":"https://pith.science/api/pith-number/25DULM2PFPFWJIFQOCJ7CEIICU/graph.json","events_json":"https://pith.science/api/pith-number/25DULM2PFPFWJIFQOCJ7CEIICU/events.json","paper":"https://pith.science/paper/25DULM2P"},"agent_actions":{"view_html":"https://pith.science/pith/25DULM2PFPFWJIFQOCJ7CEIICU","download_json":"https://pith.science/pith/25DULM2PFPFWJIFQOCJ7CEIICU.json","view_paper":"https://pith.science/paper/25DULM2P","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1804.08680&json=true","fetch_graph":"https://pith.science/api/pith-number/25DULM2PFPFWJIFQOCJ7CEIICU/graph.json","fetch_events":"https://pith.science/api/pith-number/25DULM2PFPFWJIFQOCJ7CEIICU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/25DULM2PFPFWJIFQOCJ7CEIICU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/25DULM2PFPFWJIFQOCJ7CEIICU/action/storage_attestation","attest_author":"https://pith.science/pith/25DULM2PFPFWJIFQOCJ7CEIICU/action/author_attestation","sign_citation":"https://pith.science/pith/25DULM2PFPFWJIFQOCJ7CEIICU/action/citation_signature","submit_replication":"https://pith.science/pith/25DULM2PFPFWJIFQOCJ7CEIICU/action/replication_record"}},"created_at":"2026-05-18T00:17:46.999842+00:00","updated_at":"2026-05-18T00:17:46.999842+00:00"}