{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:GNLYPKPVEJ3NSEBTHHIMKT2XKE","short_pith_number":"pith:GNLYPKPV","schema_version":"1.0","canonical_sha256":"335787a9f52276d9103339d0c54f57513af2cc9aa5029b9368d07fb188e1672c","source":{"kind":"arxiv","id":"1105.3234","version":1},"attestation_state":"computed","paper":{"title":"Rigid components in fixed-lattice and cone frameworks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DS","authors_text":"Brent Heeringa, Justin Malestein, Louis Theran, Matthew Berardi","submitted_at":"2011-05-16T21:59:49Z","abstract_excerpt":"We study the fundamental algorithmic rigidity problems for generic frameworks periodic with respect to a fixed lattice or a finite-order rotation in the plane. For fixed-lattice frameworks we give an $O(n^2)$ algorithm for deciding generic rigidity and an O(n^3) algorithm for computing rigid components. If the order of rotation is part of the input, we give an O(n^4) algorithm for deciding rigidity; in the case where the rotation's order is 3, a more specialized algorithm solves all the fundamental algorithmic rigidity problems in O(n^2) time."},"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":"1105.3234","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-05-16T21:59:49Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"8e5e1b0b65584cda8bc0a5646898bad0bbb3549c990c6e83ea25eea188156139","abstract_canon_sha256":"7427c0427bda8a957ae922646bbebe3c4935809f16dc828e506fa115b7da0ad2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:21:59.934057Z","signature_b64":"wcL96bS30NMeSNQ1pWV4J8rpUPai23XZqxIpLcYajd3QGU+CRz3ryjS8WOAoOyaiLbnKM7HVcJYNfLj+Ci5oAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"335787a9f52276d9103339d0c54f57513af2cc9aa5029b9368d07fb188e1672c","last_reissued_at":"2026-05-18T02:21:59.933291Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:21:59.933291Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Rigid components in fixed-lattice and cone frameworks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DS","authors_text":"Brent Heeringa, Justin Malestein, Louis Theran, Matthew Berardi","submitted_at":"2011-05-16T21:59:49Z","abstract_excerpt":"We study the fundamental algorithmic rigidity problems for generic frameworks periodic with respect to a fixed lattice or a finite-order rotation in the plane. For fixed-lattice frameworks we give an $O(n^2)$ algorithm for deciding generic rigidity and an O(n^3) algorithm for computing rigid components. If the order of rotation is part of the input, we give an O(n^4) algorithm for deciding rigidity; in the case where the rotation's order is 3, a more specialized algorithm solves all the fundamental algorithmic rigidity problems in O(n^2) time."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1105.3234","kind":"arxiv","version":1},"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":"1105.3234","created_at":"2026-05-18T02:21:59.933429+00:00"},{"alias_kind":"arxiv_version","alias_value":"1105.3234v1","created_at":"2026-05-18T02:21:59.933429+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1105.3234","created_at":"2026-05-18T02:21:59.933429+00:00"},{"alias_kind":"pith_short_12","alias_value":"GNLYPKPVEJ3N","created_at":"2026-05-18T12:26:30.835961+00:00"},{"alias_kind":"pith_short_16","alias_value":"GNLYPKPVEJ3NSEBT","created_at":"2026-05-18T12:26:30.835961+00:00"},{"alias_kind":"pith_short_8","alias_value":"GNLYPKPV","created_at":"2026-05-18T12:26:30.835961+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/GNLYPKPVEJ3NSEBTHHIMKT2XKE","json":"https://pith.science/pith/GNLYPKPVEJ3NSEBTHHIMKT2XKE.json","graph_json":"https://pith.science/api/pith-number/GNLYPKPVEJ3NSEBTHHIMKT2XKE/graph.json","events_json":"https://pith.science/api/pith-number/GNLYPKPVEJ3NSEBTHHIMKT2XKE/events.json","paper":"https://pith.science/paper/GNLYPKPV"},"agent_actions":{"view_html":"https://pith.science/pith/GNLYPKPVEJ3NSEBTHHIMKT2XKE","download_json":"https://pith.science/pith/GNLYPKPVEJ3NSEBTHHIMKT2XKE.json","view_paper":"https://pith.science/paper/GNLYPKPV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1105.3234&json=true","fetch_graph":"https://pith.science/api/pith-number/GNLYPKPVEJ3NSEBTHHIMKT2XKE/graph.json","fetch_events":"https://pith.science/api/pith-number/GNLYPKPVEJ3NSEBTHHIMKT2XKE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GNLYPKPVEJ3NSEBTHHIMKT2XKE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GNLYPKPVEJ3NSEBTHHIMKT2XKE/action/storage_attestation","attest_author":"https://pith.science/pith/GNLYPKPVEJ3NSEBTHHIMKT2XKE/action/author_attestation","sign_citation":"https://pith.science/pith/GNLYPKPVEJ3NSEBTHHIMKT2XKE/action/citation_signature","submit_replication":"https://pith.science/pith/GNLYPKPVEJ3NSEBTHHIMKT2XKE/action/replication_record"}},"created_at":"2026-05-18T02:21:59.933429+00:00","updated_at":"2026-05-18T02:21:59.933429+00:00"}