{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:XOG3DUIW5756DT6TRWPJ64XCIV","short_pith_number":"pith:XOG3DUIW","schema_version":"1.0","canonical_sha256":"bb8db1d116effbe1cfd38d9e9f72e24573a977c1b8f0d87526795e396ea65f2f","source":{"kind":"arxiv","id":"1009.1185","version":2},"attestation_state":"computed","paper":{"title":"Toward the Universal Rigidity of General Frameworks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"math.MG","authors_text":"Abdo Y. Alfakih, Nicole Taheri, Yinyu Ye","submitted_at":"2010-09-07T01:41:20Z","abstract_excerpt":"Let (G,P) be a bar framework of n vertices in general position in R^d, d <= n-1, where G is a (d+1)-lateration graph. In this paper, we present a constructive proof that (G,P) admits a positive semi-definite stress matrix with rank n-d-1. We also prove a similar result for a sensor network where the graph consists of m(>= d+1) anchors."},"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":"1009.1185","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.MG","submitted_at":"2010-09-07T01:41:20Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"e7e317a350497061e47d4004ac9aedf3b9ffc3f17551db72bd698ce3bf127f99","abstract_canon_sha256":"81e40d4fd9a9abb23ae2ce3630bd392e3d67f89983cebc292fcb723b6a88f38d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:31:59.925600Z","signature_b64":"wI7M0Q+scwLfBnZFfcqQtmts6SJ/4OLhCMPvDsc+LBAx1yEC2gq0cJu1HvpLlnojuIoGZWeKWv4gPRiqOWHRAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bb8db1d116effbe1cfd38d9e9f72e24573a977c1b8f0d87526795e396ea65f2f","last_reissued_at":"2026-05-18T04:31:59.924926Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:31:59.924926Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Toward the Universal Rigidity of General Frameworks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"math.MG","authors_text":"Abdo Y. Alfakih, Nicole Taheri, Yinyu Ye","submitted_at":"2010-09-07T01:41:20Z","abstract_excerpt":"Let (G,P) be a bar framework of n vertices in general position in R^d, d <= n-1, where G is a (d+1)-lateration graph. In this paper, we present a constructive proof that (G,P) admits a positive semi-definite stress matrix with rank n-d-1. We also prove a similar result for a sensor network where the graph consists of m(>= d+1) anchors."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1009.1185","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":"1009.1185","created_at":"2026-05-18T04:31:59.925020+00:00"},{"alias_kind":"arxiv_version","alias_value":"1009.1185v2","created_at":"2026-05-18T04:31:59.925020+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1009.1185","created_at":"2026-05-18T04:31:59.925020+00:00"},{"alias_kind":"pith_short_12","alias_value":"XOG3DUIW5756","created_at":"2026-05-18T12:26:17.028572+00:00"},{"alias_kind":"pith_short_16","alias_value":"XOG3DUIW5756DT6T","created_at":"2026-05-18T12:26:17.028572+00:00"},{"alias_kind":"pith_short_8","alias_value":"XOG3DUIW","created_at":"2026-05-18T12:26:17.028572+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/XOG3DUIW5756DT6TRWPJ64XCIV","json":"https://pith.science/pith/XOG3DUIW5756DT6TRWPJ64XCIV.json","graph_json":"https://pith.science/api/pith-number/XOG3DUIW5756DT6TRWPJ64XCIV/graph.json","events_json":"https://pith.science/api/pith-number/XOG3DUIW5756DT6TRWPJ64XCIV/events.json","paper":"https://pith.science/paper/XOG3DUIW"},"agent_actions":{"view_html":"https://pith.science/pith/XOG3DUIW5756DT6TRWPJ64XCIV","download_json":"https://pith.science/pith/XOG3DUIW5756DT6TRWPJ64XCIV.json","view_paper":"https://pith.science/paper/XOG3DUIW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1009.1185&json=true","fetch_graph":"https://pith.science/api/pith-number/XOG3DUIW5756DT6TRWPJ64XCIV/graph.json","fetch_events":"https://pith.science/api/pith-number/XOG3DUIW5756DT6TRWPJ64XCIV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XOG3DUIW5756DT6TRWPJ64XCIV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XOG3DUIW5756DT6TRWPJ64XCIV/action/storage_attestation","attest_author":"https://pith.science/pith/XOG3DUIW5756DT6TRWPJ64XCIV/action/author_attestation","sign_citation":"https://pith.science/pith/XOG3DUIW5756DT6TRWPJ64XCIV/action/citation_signature","submit_replication":"https://pith.science/pith/XOG3DUIW5756DT6TRWPJ64XCIV/action/replication_record"}},"created_at":"2026-05-18T04:31:59.925020+00:00","updated_at":"2026-05-18T04:31:59.925020+00:00"}