{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:4ZXEELOX5URASGJXIOE7NTQP4T","short_pith_number":"pith:4ZXEELOX","schema_version":"1.0","canonical_sha256":"e66e422dd7ed220919374389f6ce0fe4e018efceb250aca1f6b23c6e76a58440","source":{"kind":"arxiv","id":"1311.4859","version":1},"attestation_state":"computed","paper":{"title":"Nucleation-free $3D$ rigidity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","math.MG"],"primary_cat":"cs.CG","authors_text":"Ileana Streinu, Jialong Cheng, Meera Sitharam","submitted_at":"2013-11-19T20:06:38Z","abstract_excerpt":"When all non-edge distances of a graph realized in $\\mathbb{R}^{d}$ as a {\\em bar-and-joint framework} are generically {\\em implied} by the bar (edge) lengths, the graph is said to be {\\em rigid} in $\\mathbb{R}^{d}$. For $d=3$, characterizing rigid graphs, determining implied non-edges and {\\em dependent} edge sets remains an elusive, long-standing open problem.\n  One obstacle is to determine when implied non-edges can exist without non-trivial rigid induced subgraphs, i.e., {\\em nucleations}, and how to deal with them.\n  In this paper, we give general inductive construction schemes and proof "},"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":"1311.4859","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2013-11-19T20:06:38Z","cross_cats_sorted":["math.CO","math.MG"],"title_canon_sha256":"7974dd060121626f8d3fabeb653da2471188d76bb9a8a1a9212ba091f0f721ad","abstract_canon_sha256":"3850d624e7c70ab20744b8fff9b0298d016ee5a80a15c886d771c3f4b4c0cd21"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:06:43.348416Z","signature_b64":"vZyfyAYjWokLR7ps6xrqyu7JAPrH8cXjxnwVJcMwzwSVxaeWDFMkdDrWyMDa9qHiDZuamuNOIChCvkzAz88xAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e66e422dd7ed220919374389f6ce0fe4e018efceb250aca1f6b23c6e76a58440","last_reissued_at":"2026-05-18T03:06:43.347914Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:06:43.347914Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Nucleation-free $3D$ rigidity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","math.MG"],"primary_cat":"cs.CG","authors_text":"Ileana Streinu, Jialong Cheng, Meera Sitharam","submitted_at":"2013-11-19T20:06:38Z","abstract_excerpt":"When all non-edge distances of a graph realized in $\\mathbb{R}^{d}$ as a {\\em bar-and-joint framework} are generically {\\em implied} by the bar (edge) lengths, the graph is said to be {\\em rigid} in $\\mathbb{R}^{d}$. For $d=3$, characterizing rigid graphs, determining implied non-edges and {\\em dependent} edge sets remains an elusive, long-standing open problem.\n  One obstacle is to determine when implied non-edges can exist without non-trivial rigid induced subgraphs, i.e., {\\em nucleations}, and how to deal with them.\n  In this paper, we give general inductive construction schemes and proof "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.4859","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":"1311.4859","created_at":"2026-05-18T03:06:43.347986+00:00"},{"alias_kind":"arxiv_version","alias_value":"1311.4859v1","created_at":"2026-05-18T03:06:43.347986+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.4859","created_at":"2026-05-18T03:06:43.347986+00:00"},{"alias_kind":"pith_short_12","alias_value":"4ZXEELOX5URA","created_at":"2026-05-18T12:27:34.582898+00:00"},{"alias_kind":"pith_short_16","alias_value":"4ZXEELOX5URASGJX","created_at":"2026-05-18T12:27:34.582898+00:00"},{"alias_kind":"pith_short_8","alias_value":"4ZXEELOX","created_at":"2026-05-18T12:27:34.582898+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/4ZXEELOX5URASGJXIOE7NTQP4T","json":"https://pith.science/pith/4ZXEELOX5URASGJXIOE7NTQP4T.json","graph_json":"https://pith.science/api/pith-number/4ZXEELOX5URASGJXIOE7NTQP4T/graph.json","events_json":"https://pith.science/api/pith-number/4ZXEELOX5URASGJXIOE7NTQP4T/events.json","paper":"https://pith.science/paper/4ZXEELOX"},"agent_actions":{"view_html":"https://pith.science/pith/4ZXEELOX5URASGJXIOE7NTQP4T","download_json":"https://pith.science/pith/4ZXEELOX5URASGJXIOE7NTQP4T.json","view_paper":"https://pith.science/paper/4ZXEELOX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1311.4859&json=true","fetch_graph":"https://pith.science/api/pith-number/4ZXEELOX5URASGJXIOE7NTQP4T/graph.json","fetch_events":"https://pith.science/api/pith-number/4ZXEELOX5URASGJXIOE7NTQP4T/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4ZXEELOX5URASGJXIOE7NTQP4T/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4ZXEELOX5URASGJXIOE7NTQP4T/action/storage_attestation","attest_author":"https://pith.science/pith/4ZXEELOX5URASGJXIOE7NTQP4T/action/author_attestation","sign_citation":"https://pith.science/pith/4ZXEELOX5URASGJXIOE7NTQP4T/action/citation_signature","submit_replication":"https://pith.science/pith/4ZXEELOX5URASGJXIOE7NTQP4T/action/replication_record"}},"created_at":"2026-05-18T03:06:43.347986+00:00","updated_at":"2026-05-18T03:06:43.347986+00:00"}