{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:ALTSUUIPOLL2AY5DCC3UVLOCCC","short_pith_number":"pith:ALTSUUIP","schema_version":"1.0","canonical_sha256":"02e72a510f72d7a063a310b74aadc210ad4be95f0a2de81d7c001bb528c0005f","source":{"kind":"arxiv","id":"1008.1837","version":4},"attestation_state":"computed","paper":{"title":"Generic combinatorial rigidity of periodic frameworks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.GT"],"primary_cat":"math.CO","authors_text":"Justin Malestein, Louis Theran","submitted_at":"2010-08-11T06:29:51Z","abstract_excerpt":"We give a combinatorial characterization of generic minimal rigidity for planar periodic frameworks. The characterization is a true analogue of the Maxwell-Laman Theorem from rigidity theory: it is stated in terms of a finite combinatorial object and the conditions are checkable by polynomial time combinatorial algorithms.\n  To prove our rigidity theorem we introduce and develop periodic direction networks and Z2-graded-sparse colored graphs."},"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":"1008.1837","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-08-11T06:29:51Z","cross_cats_sorted":["math.GT"],"title_canon_sha256":"f00f47b0617fdf4376857e25986816e8a38a019729675a8ee00d884e41c3da24","abstract_canon_sha256":"22c3b07bab769172091324df10ca31c9402f23d217d50e53aa6ae7a19de05566"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:42:34.145771Z","signature_b64":"yiktuXJMv/Gp2d2r/rDWG3SyOykFDhE8Hz3f6CcHaXQnWiorE4Xkm0oz5c09Cp+KZmUkiBDvoHzuiMPkSAuBCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"02e72a510f72d7a063a310b74aadc210ad4be95f0a2de81d7c001bb528c0005f","last_reissued_at":"2026-05-18T03:42:34.145140Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:42:34.145140Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Generic combinatorial rigidity of periodic frameworks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.GT"],"primary_cat":"math.CO","authors_text":"Justin Malestein, Louis Theran","submitted_at":"2010-08-11T06:29:51Z","abstract_excerpt":"We give a combinatorial characterization of generic minimal rigidity for planar periodic frameworks. The characterization is a true analogue of the Maxwell-Laman Theorem from rigidity theory: it is stated in terms of a finite combinatorial object and the conditions are checkable by polynomial time combinatorial algorithms.\n  To prove our rigidity theorem we introduce and develop periodic direction networks and Z2-graded-sparse colored graphs."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1008.1837","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":""},"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":"1008.1837","created_at":"2026-05-18T03:42:34.145226+00:00"},{"alias_kind":"arxiv_version","alias_value":"1008.1837v4","created_at":"2026-05-18T03:42:34.145226+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1008.1837","created_at":"2026-05-18T03:42:34.145226+00:00"},{"alias_kind":"pith_short_12","alias_value":"ALTSUUIPOLL2","created_at":"2026-05-18T12:26:05.355336+00:00"},{"alias_kind":"pith_short_16","alias_value":"ALTSUUIPOLL2AY5D","created_at":"2026-05-18T12:26:05.355336+00:00"},{"alias_kind":"pith_short_8","alias_value":"ALTSUUIP","created_at":"2026-05-18T12:26:05.355336+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/ALTSUUIPOLL2AY5DCC3UVLOCCC","json":"https://pith.science/pith/ALTSUUIPOLL2AY5DCC3UVLOCCC.json","graph_json":"https://pith.science/api/pith-number/ALTSUUIPOLL2AY5DCC3UVLOCCC/graph.json","events_json":"https://pith.science/api/pith-number/ALTSUUIPOLL2AY5DCC3UVLOCCC/events.json","paper":"https://pith.science/paper/ALTSUUIP"},"agent_actions":{"view_html":"https://pith.science/pith/ALTSUUIPOLL2AY5DCC3UVLOCCC","download_json":"https://pith.science/pith/ALTSUUIPOLL2AY5DCC3UVLOCCC.json","view_paper":"https://pith.science/paper/ALTSUUIP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1008.1837&json=true","fetch_graph":"https://pith.science/api/pith-number/ALTSUUIPOLL2AY5DCC3UVLOCCC/graph.json","fetch_events":"https://pith.science/api/pith-number/ALTSUUIPOLL2AY5DCC3UVLOCCC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ALTSUUIPOLL2AY5DCC3UVLOCCC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ALTSUUIPOLL2AY5DCC3UVLOCCC/action/storage_attestation","attest_author":"https://pith.science/pith/ALTSUUIPOLL2AY5DCC3UVLOCCC/action/author_attestation","sign_citation":"https://pith.science/pith/ALTSUUIPOLL2AY5DCC3UVLOCCC/action/citation_signature","submit_replication":"https://pith.science/pith/ALTSUUIPOLL2AY5DCC3UVLOCCC/action/replication_record"}},"created_at":"2026-05-18T03:42:34.145226+00:00","updated_at":"2026-05-18T03:42:34.145226+00:00"}