{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:AGOVMF4JGMW25XM5K4FY5MY7MX","short_pith_number":"pith:AGOVMF4J","schema_version":"1.0","canonical_sha256":"019d561789332daedd9d570b8eb31f65cb09af1b45fc76750e11323ff97a0f4c","source":{"kind":"arxiv","id":"2311.14451","version":2},"attestation_state":"computed","paper":{"title":"Rigid partitions: from high connectivity to random graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alan Lew, Michael Krivelevich, Peleg Michaeli","submitted_at":"2023-11-24T13:01:01Z","abstract_excerpt":"A graph is called $d$-rigid if there exists a generic embedding of its vertex set into $\\mathbb{R}^d$ such that every continuous motion of the vertices that preserves the lengths of all edges actually preserves the distances between all pairs of vertices. The rigidity of a graph is the maximal $d$ such that the graph is $d$-rigid. We present new sufficient conditions for the $d$-rigidity of a graph in terms of the existence of ``rigid partitions'' -- partitions of the graph that satisfy certain connectivity properties. This extends previous results by Crapo, Lindemann, and Lew, Nevo, Peled and"},"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":"2311.14451","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2023-11-24T13:01:01Z","cross_cats_sorted":[],"title_canon_sha256":"2f403ed46329a2c81053513f2c68ce2b2455c2c97a7d330c6628f89199940e4a","abstract_canon_sha256":"cc49e8a5afc21be8201a31f700c834749563a6866cabba7fb2a7a8e4b6e2e7c3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:23:09.769640Z","signature_b64":"zoLPaREuu6JlyeVgr83Rx2bl/0EXe1hS7yd9m056XJbWuMaPi3wvy1TLZXNq9TBo9Q+ae2ofG2N+hSpP+CAADQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"019d561789332daedd9d570b8eb31f65cb09af1b45fc76750e11323ff97a0f4c","last_reissued_at":"2026-07-05T07:23:09.769122Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:23:09.769122Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Rigid partitions: from high connectivity to random graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alan Lew, Michael Krivelevich, Peleg Michaeli","submitted_at":"2023-11-24T13:01:01Z","abstract_excerpt":"A graph is called $d$-rigid if there exists a generic embedding of its vertex set into $\\mathbb{R}^d$ such that every continuous motion of the vertices that preserves the lengths of all edges actually preserves the distances between all pairs of vertices. The rigidity of a graph is the maximal $d$ such that the graph is $d$-rigid. We present new sufficient conditions for the $d$-rigidity of a graph in terms of the existence of ``rigid partitions'' -- partitions of the graph that satisfy certain connectivity properties. This extends previous results by Crapo, Lindemann, and Lew, Nevo, Peled and"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2311.14451","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2311.14451/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":"2311.14451","created_at":"2026-07-05T07:23:09.769176+00:00"},{"alias_kind":"arxiv_version","alias_value":"2311.14451v2","created_at":"2026-07-05T07:23:09.769176+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2311.14451","created_at":"2026-07-05T07:23:09.769176+00:00"},{"alias_kind":"pith_short_12","alias_value":"AGOVMF4JGMW2","created_at":"2026-07-05T07:23:09.769176+00:00"},{"alias_kind":"pith_short_16","alias_value":"AGOVMF4JGMW25XM5","created_at":"2026-07-05T07:23:09.769176+00:00"},{"alias_kind":"pith_short_8","alias_value":"AGOVMF4J","created_at":"2026-07-05T07:23:09.769176+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.04488","citing_title":"The Hamilton cycle space of random regular graphs and randomly perturbed graphs","ref_index":21,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/AGOVMF4JGMW25XM5K4FY5MY7MX","json":"https://pith.science/pith/AGOVMF4JGMW25XM5K4FY5MY7MX.json","graph_json":"https://pith.science/api/pith-number/AGOVMF4JGMW25XM5K4FY5MY7MX/graph.json","events_json":"https://pith.science/api/pith-number/AGOVMF4JGMW25XM5K4FY5MY7MX/events.json","paper":"https://pith.science/paper/AGOVMF4J"},"agent_actions":{"view_html":"https://pith.science/pith/AGOVMF4JGMW25XM5K4FY5MY7MX","download_json":"https://pith.science/pith/AGOVMF4JGMW25XM5K4FY5MY7MX.json","view_paper":"https://pith.science/paper/AGOVMF4J","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2311.14451&json=true","fetch_graph":"https://pith.science/api/pith-number/AGOVMF4JGMW25XM5K4FY5MY7MX/graph.json","fetch_events":"https://pith.science/api/pith-number/AGOVMF4JGMW25XM5K4FY5MY7MX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AGOVMF4JGMW25XM5K4FY5MY7MX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AGOVMF4JGMW25XM5K4FY5MY7MX/action/storage_attestation","attest_author":"https://pith.science/pith/AGOVMF4JGMW25XM5K4FY5MY7MX/action/author_attestation","sign_citation":"https://pith.science/pith/AGOVMF4JGMW25XM5K4FY5MY7MX/action/citation_signature","submit_replication":"https://pith.science/pith/AGOVMF4JGMW25XM5K4FY5MY7MX/action/replication_record"}},"created_at":"2026-07-05T07:23:09.769176+00:00","updated_at":"2026-07-05T07:23:09.769176+00:00"}