{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:AGOVMF4JGMW25XM5K4FY5MY7MX","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":"cc49e8a5afc21be8201a31f700c834749563a6866cabba7fb2a7a8e4b6e2e7c3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2023-11-24T13:01:01Z","title_canon_sha256":"2f403ed46329a2c81053513f2c68ce2b2455c2c97a7d330c6628f89199940e4a"},"schema_version":"1.0","source":{"id":"2311.14451","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2311.14451","created_at":"2026-07-05T07:23:09Z"},{"alias_kind":"arxiv_version","alias_value":"2311.14451v2","created_at":"2026-07-05T07:23:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2311.14451","created_at":"2026-07-05T07:23:09Z"},{"alias_kind":"pith_short_12","alias_value":"AGOVMF4JGMW2","created_at":"2026-07-05T07:23:09Z"},{"alias_kind":"pith_short_16","alias_value":"AGOVMF4JGMW25XM5","created_at":"2026-07-05T07:23:09Z"},{"alias_kind":"pith_short_8","alias_value":"AGOVMF4J","created_at":"2026-07-05T07:23:09Z"}],"graph_snapshots":[{"event_id":"sha256:1e6ee0447c06c71693f1d6b8553f0e6ba9812beead0e710742d96de6a43ad421","target":"graph","created_at":"2026-07-05T07:23:09Z","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/2311.14451/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Alan Lew, Michael Krivelevich, Peleg Michaeli","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2023-11-24T13:01:01Z","title":"Rigid partitions: from high connectivity to random graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2311.14451","kind":"arxiv","version":2},"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:fe60e6d26304769762e37f8a8b3e234708470cc3af1e84f37aaabb01b0ba3f25","target":"record","created_at":"2026-07-05T07:23:09Z","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":"cc49e8a5afc21be8201a31f700c834749563a6866cabba7fb2a7a8e4b6e2e7c3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2023-11-24T13:01:01Z","title_canon_sha256":"2f403ed46329a2c81053513f2c68ce2b2455c2c97a7d330c6628f89199940e4a"},"schema_version":"1.0","source":{"id":"2311.14451","kind":"arxiv","version":2}},"canonical_sha256":"019d561789332daedd9d570b8eb31f65cb09af1b45fc76750e11323ff97a0f4c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"019d561789332daedd9d570b8eb31f65cb09af1b45fc76750e11323ff97a0f4c","first_computed_at":"2026-07-05T07:23:09.769122Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:23:09.769122Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zoLPaREuu6JlyeVgr83Rx2bl/0EXe1hS7yd9m056XJbWuMaPi3wvy1TLZXNq9TBo9Q+ae2ofG2N+hSpP+CAADQ==","signature_status":"signed_v1","signed_at":"2026-07-05T07:23:09.769640Z","signed_message":"canonical_sha256_bytes"},"source_id":"2311.14451","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fe60e6d26304769762e37f8a8b3e234708470cc3af1e84f37aaabb01b0ba3f25","sha256:1e6ee0447c06c71693f1d6b8553f0e6ba9812beead0e710742d96de6a43ad421"],"state_sha256":"dd4480847d8ec26da13939fdb2e708ac5f70a1fc899b96581100f5b95973f3e3"}