{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:ON5OUSROZWG4EGRJY2P6WR7G5U","short_pith_number":"pith:ON5OUSRO","schema_version":"1.0","canonical_sha256":"737aea4a2ecd8dc21a29c69feb47e6ed0046d213a03bd9825a492a4021e5f461","source":{"kind":"arxiv","id":"1011.5553","version":3},"attestation_state":"computed","paper":{"title":"On affine rigidity","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Craig Gotsman, Dylan P. Thurston, Ligang Liu, Steven J. Gortler","submitted_at":"2010-11-25T05:11:34Z","abstract_excerpt":"We define the notion of affine rigidity of a hypergraph and prove a variety of fundamental results for this notion. First, we show that affine rigidity can be determined by the rank of a specific matrix which implies that affine rigidity is a generic property of the hypergraph.Then we prove that if a graph is is $(d+1)$-vertex-connected, then it must be \"generically neighborhood affinely rigid\" in $d$-dimensional space. This implies that if a graph is $(d+1)$-vertex-connected then any generic framework of its squared graph must be universally rigid.\n  Our results, and affine rigidity more gene"},"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":"1011.5553","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.CG","submitted_at":"2010-11-25T05:11:34Z","cross_cats_sorted":[],"title_canon_sha256":"1d601595076a0adcc0224164f946cde6a4c4801cc3f9f30dc615230ce25f3d36","abstract_canon_sha256":"8b7d469986232868632ce2cef39103b1dd49c22624a3970a7f8a5d7ed79cd66a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:16:06.687420Z","signature_b64":"pJOSfBDnd/AQf8ZEYtHMdNl5e6QZ9BrJj9ND7Lu57UpEENRqVQoVLZ6nMau6wZGKC1L5y6/kfpx89f7lJjoSBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"737aea4a2ecd8dc21a29c69feb47e6ed0046d213a03bd9825a492a4021e5f461","last_reissued_at":"2026-05-18T03:16:06.686543Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:16:06.686543Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On affine rigidity","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Craig Gotsman, Dylan P. Thurston, Ligang Liu, Steven J. Gortler","submitted_at":"2010-11-25T05:11:34Z","abstract_excerpt":"We define the notion of affine rigidity of a hypergraph and prove a variety of fundamental results for this notion. First, we show that affine rigidity can be determined by the rank of a specific matrix which implies that affine rigidity is a generic property of the hypergraph.Then we prove that if a graph is is $(d+1)$-vertex-connected, then it must be \"generically neighborhood affinely rigid\" in $d$-dimensional space. This implies that if a graph is $(d+1)$-vertex-connected then any generic framework of its squared graph must be universally rigid.\n  Our results, and affine rigidity more gene"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1011.5553","kind":"arxiv","version":3},"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":"1011.5553","created_at":"2026-05-18T03:16:06.686679+00:00"},{"alias_kind":"arxiv_version","alias_value":"1011.5553v3","created_at":"2026-05-18T03:16:06.686679+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.5553","created_at":"2026-05-18T03:16:06.686679+00:00"},{"alias_kind":"pith_short_12","alias_value":"ON5OUSROZWG4","created_at":"2026-05-18T12:26:12.377268+00:00"},{"alias_kind":"pith_short_16","alias_value":"ON5OUSROZWG4EGRJ","created_at":"2026-05-18T12:26:12.377268+00:00"},{"alias_kind":"pith_short_8","alias_value":"ON5OUSRO","created_at":"2026-05-18T12:26:12.377268+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/ON5OUSROZWG4EGRJY2P6WR7G5U","json":"https://pith.science/pith/ON5OUSROZWG4EGRJY2P6WR7G5U.json","graph_json":"https://pith.science/api/pith-number/ON5OUSROZWG4EGRJY2P6WR7G5U/graph.json","events_json":"https://pith.science/api/pith-number/ON5OUSROZWG4EGRJY2P6WR7G5U/events.json","paper":"https://pith.science/paper/ON5OUSRO"},"agent_actions":{"view_html":"https://pith.science/pith/ON5OUSROZWG4EGRJY2P6WR7G5U","download_json":"https://pith.science/pith/ON5OUSROZWG4EGRJY2P6WR7G5U.json","view_paper":"https://pith.science/paper/ON5OUSRO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1011.5553&json=true","fetch_graph":"https://pith.science/api/pith-number/ON5OUSROZWG4EGRJY2P6WR7G5U/graph.json","fetch_events":"https://pith.science/api/pith-number/ON5OUSROZWG4EGRJY2P6WR7G5U/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ON5OUSROZWG4EGRJY2P6WR7G5U/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ON5OUSROZWG4EGRJY2P6WR7G5U/action/storage_attestation","attest_author":"https://pith.science/pith/ON5OUSROZWG4EGRJY2P6WR7G5U/action/author_attestation","sign_citation":"https://pith.science/pith/ON5OUSROZWG4EGRJY2P6WR7G5U/action/citation_signature","submit_replication":"https://pith.science/pith/ON5OUSROZWG4EGRJY2P6WR7G5U/action/replication_record"}},"created_at":"2026-05-18T03:16:06.686679+00:00","updated_at":"2026-05-18T03:16:06.686679+00:00"}