{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:IGHWGXKGPNHCTIQQU5ECKDS6P2","short_pith_number":"pith:IGHWGXKG","schema_version":"1.0","canonical_sha256":"418f635d467b4e29a210a748250e5e7eae8c59ffbe8fc40d3adda9b9aca2b540","source":{"kind":"arxiv","id":"2208.13855","version":4},"attestation_state":"computed","paper":{"title":"Determining a Points Configuration from a Subset of the Pairwise Distances","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.CO","math.PR"],"primary_cat":"math.MG","authors_text":"Elad Tzalik, Itai Benjamini","submitted_at":"2022-08-29T19:53:09Z","abstract_excerpt":"We study rigidity without assuming general position. Given $n$ distinct labelled points and a set $\\mathcal{P}\\subseteq \\binom{[n]}{2}$ of revealed pairs, we ask when the corresponding distances determine the configuration up to isometry. On the line, we prove an extremal result: if $|\\mathcal{P}|=\\Omega(n^{3/2})$, then there is an induced globally rigid subgraph on $\\Omega(|\\mathcal{P}|/n)$ vertices. In other words, any dense enough graph will contain a subset of labels whose locations can be determined from their distances up to isometry. To prove this, we establish a graph-theoretic result,"},"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":"2208.13855","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.MG","submitted_at":"2022-08-29T19:53:09Z","cross_cats_sorted":["math.CO","math.PR"],"title_canon_sha256":"faa2b726c2d80900fdbcdd858f6ebe4729a03412da39bafda5d3fc3e10519e42","abstract_canon_sha256":"6877392815a333bb3a9a841c9b7620c7df6597ff36e5bf39acdc0938f5c7c983"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-02T01:04:14.245235Z","signature_b64":"x5iefSV+adUP/UaQg9uUPfX39DcMuU1tCzj01nhuF3Vp3TEI+8JAKyBXsJisCh4zhXI1jwVUeuYaYEr8OXLDCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"418f635d467b4e29a210a748250e5e7eae8c59ffbe8fc40d3adda9b9aca2b540","last_reissued_at":"2026-06-02T01:04:14.244723Z","signature_status":"signed_v1","first_computed_at":"2026-06-02T01:04:14.244723Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Determining a Points Configuration from a Subset of the Pairwise Distances","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.CO","math.PR"],"primary_cat":"math.MG","authors_text":"Elad Tzalik, Itai Benjamini","submitted_at":"2022-08-29T19:53:09Z","abstract_excerpt":"We study rigidity without assuming general position. Given $n$ distinct labelled points and a set $\\mathcal{P}\\subseteq \\binom{[n]}{2}$ of revealed pairs, we ask when the corresponding distances determine the configuration up to isometry. On the line, we prove an extremal result: if $|\\mathcal{P}|=\\Omega(n^{3/2})$, then there is an induced globally rigid subgraph on $\\Omega(|\\mathcal{P}|/n)$ vertices. In other words, any dense enough graph will contain a subset of labels whose locations can be determined from their distances up to isometry. To prove this, we establish a graph-theoretic result,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2208.13855","kind":"arxiv","version":4},"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/2208.13855/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2208.13855","created_at":"2026-06-02T01:04:14.244783+00:00"},{"alias_kind":"arxiv_version","alias_value":"2208.13855v4","created_at":"2026-06-02T01:04:14.244783+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2208.13855","created_at":"2026-06-02T01:04:14.244783+00:00"},{"alias_kind":"pith_short_12","alias_value":"IGHWGXKGPNHC","created_at":"2026-06-02T01:04:14.244783+00:00"},{"alias_kind":"pith_short_16","alias_value":"IGHWGXKGPNHCTIQQ","created_at":"2026-06-02T01:04:14.244783+00:00"},{"alias_kind":"pith_short_8","alias_value":"IGHWGXKG","created_at":"2026-06-02T01:04:14.244783+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":2,"sample":[{"citing_arxiv_id":"2605.25711","citing_title":"On the $d$-rigidity phase transition in random graphs","ref_index":7,"is_internal_anchor":true},{"citing_arxiv_id":"2604.09176","citing_title":"Sharp threshold for reconstructing points on the line","ref_index":3,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/IGHWGXKGPNHCTIQQU5ECKDS6P2","json":"https://pith.science/pith/IGHWGXKGPNHCTIQQU5ECKDS6P2.json","graph_json":"https://pith.science/api/pith-number/IGHWGXKGPNHCTIQQU5ECKDS6P2/graph.json","events_json":"https://pith.science/api/pith-number/IGHWGXKGPNHCTIQQU5ECKDS6P2/events.json","paper":"https://pith.science/paper/IGHWGXKG"},"agent_actions":{"view_html":"https://pith.science/pith/IGHWGXKGPNHCTIQQU5ECKDS6P2","download_json":"https://pith.science/pith/IGHWGXKGPNHCTIQQU5ECKDS6P2.json","view_paper":"https://pith.science/paper/IGHWGXKG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2208.13855&json=true","fetch_graph":"https://pith.science/api/pith-number/IGHWGXKGPNHCTIQQU5ECKDS6P2/graph.json","fetch_events":"https://pith.science/api/pith-number/IGHWGXKGPNHCTIQQU5ECKDS6P2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IGHWGXKGPNHCTIQQU5ECKDS6P2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IGHWGXKGPNHCTIQQU5ECKDS6P2/action/storage_attestation","attest_author":"https://pith.science/pith/IGHWGXKGPNHCTIQQU5ECKDS6P2/action/author_attestation","sign_citation":"https://pith.science/pith/IGHWGXKGPNHCTIQQU5ECKDS6P2/action/citation_signature","submit_replication":"https://pith.science/pith/IGHWGXKGPNHCTIQQU5ECKDS6P2/action/replication_record"}},"created_at":"2026-06-02T01:04:14.244783+00:00","updated_at":"2026-06-02T01:04:14.244783+00:00"}