{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2005:6KYNASS6TCEGQF4RY7RHIVDB2R","short_pith_number":"pith:6KYNASS6","schema_version":"1.0","canonical_sha256":"f2b0d04a5e9888681791c7e2745461d472165c7bb40f8ddcecff6e943c55a794","source":{"kind":"arxiv","id":"math/0503050","version":2},"attestation_state":"computed","paper":{"title":"Rigidity theory for matroids","license":"","headline":"","cross_cats":["math.MG"],"primary_cat":"math.CO","authors_text":"Jeremy L. Martin, Mike Develin, Victor Reiner","submitted_at":"2005-03-02T22:46:09Z","abstract_excerpt":"Combinatorial rigidity theory seeks to describe the rigidity or flexibility of bar-joint frameworks in R^d in terms of the structure of the underlying graph G. The goal of this article is to broaden the foundations of combinatorial rigidity theory by replacing G with an arbitrary representable matroid M. The ideas of rigidity independence and parallel independence, as well as Laman's and Recski's combinatorial characterizations of 2-dimensional rigidity for graphs, can naturally be extended to this winder setting. As we explain, many of these fundamental concepts really depend only on the matr"},"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":"math/0503050","kind":"arxiv","version":2},"metadata":{"license":"","primary_cat":"math.CO","submitted_at":"2005-03-02T22:46:09Z","cross_cats_sorted":["math.MG"],"title_canon_sha256":"7e0a528dee6cc7e7ae808ac16b3a16fac006d1617213babca966d8592e8480cf","abstract_canon_sha256":"3934590c4e6f3f7a63b0531f6f0199e2e6b5319d205d13ba24dabf3ad389f2b2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:11:40.920063Z","signature_b64":"BM8LAM+Uv/QP2anOZN/RXBZSxjO91PArek2TacMhJB5SeOMLx503bVoW3+W+d8oY/iTgRXjvyyFNxIhnVUi0AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f2b0d04a5e9888681791c7e2745461d472165c7bb40f8ddcecff6e943c55a794","last_reissued_at":"2026-05-18T04:11:40.919605Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:11:40.919605Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Rigidity theory for matroids","license":"","headline":"","cross_cats":["math.MG"],"primary_cat":"math.CO","authors_text":"Jeremy L. Martin, Mike Develin, Victor Reiner","submitted_at":"2005-03-02T22:46:09Z","abstract_excerpt":"Combinatorial rigidity theory seeks to describe the rigidity or flexibility of bar-joint frameworks in R^d in terms of the structure of the underlying graph G. The goal of this article is to broaden the foundations of combinatorial rigidity theory by replacing G with an arbitrary representable matroid M. The ideas of rigidity independence and parallel independence, as well as Laman's and Recski's combinatorial characterizations of 2-dimensional rigidity for graphs, can naturally be extended to this winder setting. As we explain, many of these fundamental concepts really depend only on the matr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0503050","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":""},"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":"math/0503050","created_at":"2026-05-18T04:11:40.919674+00:00"},{"alias_kind":"arxiv_version","alias_value":"math/0503050v2","created_at":"2026-05-18T04:11:40.919674+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0503050","created_at":"2026-05-18T04:11:40.919674+00:00"},{"alias_kind":"pith_short_12","alias_value":"6KYNASS6TCEG","created_at":"2026-05-18T12:25:53.335082+00:00"},{"alias_kind":"pith_short_16","alias_value":"6KYNASS6TCEGQF4R","created_at":"2026-05-18T12:25:53.335082+00:00"},{"alias_kind":"pith_short_8","alias_value":"6KYNASS6","created_at":"2026-05-18T12:25:53.335082+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/6KYNASS6TCEGQF4RY7RHIVDB2R","json":"https://pith.science/pith/6KYNASS6TCEGQF4RY7RHIVDB2R.json","graph_json":"https://pith.science/api/pith-number/6KYNASS6TCEGQF4RY7RHIVDB2R/graph.json","events_json":"https://pith.science/api/pith-number/6KYNASS6TCEGQF4RY7RHIVDB2R/events.json","paper":"https://pith.science/paper/6KYNASS6"},"agent_actions":{"view_html":"https://pith.science/pith/6KYNASS6TCEGQF4RY7RHIVDB2R","download_json":"https://pith.science/pith/6KYNASS6TCEGQF4RY7RHIVDB2R.json","view_paper":"https://pith.science/paper/6KYNASS6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=math/0503050&json=true","fetch_graph":"https://pith.science/api/pith-number/6KYNASS6TCEGQF4RY7RHIVDB2R/graph.json","fetch_events":"https://pith.science/api/pith-number/6KYNASS6TCEGQF4RY7RHIVDB2R/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6KYNASS6TCEGQF4RY7RHIVDB2R/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6KYNASS6TCEGQF4RY7RHIVDB2R/action/storage_attestation","attest_author":"https://pith.science/pith/6KYNASS6TCEGQF4RY7RHIVDB2R/action/author_attestation","sign_citation":"https://pith.science/pith/6KYNASS6TCEGQF4RY7RHIVDB2R/action/citation_signature","submit_replication":"https://pith.science/pith/6KYNASS6TCEGQF4RY7RHIVDB2R/action/replication_record"}},"created_at":"2026-05-18T04:11:40.919674+00:00","updated_at":"2026-05-18T04:11:40.919674+00:00"}