{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:Y2JF7B5QJEK6H7ZTLPVO3DYE5Y","short_pith_number":"pith:Y2JF7B5Q","schema_version":"1.0","canonical_sha256":"c6925f87b04915e3ff335beaed8f04ee3c97b3a17b33ff8c25bd663699a95d3d","source":{"kind":"arxiv","id":"1703.04035","version":2},"attestation_state":"computed","paper":{"title":"Laman Graphs are Generically Bearing Rigid in Arbitrary Dimensions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","math.MG"],"primary_cat":"cs.SY","authors_text":"Daniel Zelazo, Hyo-Sung Ahn, Minh-Hoang Trinh, Shiyu Zhao, Zhiyong Sun","submitted_at":"2017-03-11T22:33:04Z","abstract_excerpt":"This paper addresses the problem of constructing bearing rigid networks in arbitrary dimensions. We first show that the bearing rigidity of a network is a generic property that is critically determined by the underlying graph of the network. A new notion termed generic bearing rigidity is defined for graphs. If the underlying graph of a network is generically bearing rigid, then the network is bearing rigid for almost all configurations; otherwise, the network is not bearing rigid for any configuration. As a result, the key to construct bearing rigid networks is to construct generically bearin"},"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":"1703.04035","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2017-03-11T22:33:04Z","cross_cats_sorted":["math.CO","math.MG"],"title_canon_sha256":"d928a5c0861793dee71902b389d49c72d0792c4bc9a7744b264a47560a14ec0b","abstract_canon_sha256":"cbeda095d9efe12d4cff2c92839e01a8ba7c4b5fa92a00e3369d3a8c10dddc12"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:36:51.247194Z","signature_b64":"g8DWwEAEuEH+/TB6zwh/NBNsfAvdIG7NuEBKLL0O0yBnjGWh0a7X9Si7C0AvfWPyW9kbCpD3hRYAQYQj6Nd2Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c6925f87b04915e3ff335beaed8f04ee3c97b3a17b33ff8c25bd663699a95d3d","last_reissued_at":"2026-05-18T00:36:51.246638Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:36:51.246638Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Laman Graphs are Generically Bearing Rigid in Arbitrary Dimensions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","math.MG"],"primary_cat":"cs.SY","authors_text":"Daniel Zelazo, Hyo-Sung Ahn, Minh-Hoang Trinh, Shiyu Zhao, Zhiyong Sun","submitted_at":"2017-03-11T22:33:04Z","abstract_excerpt":"This paper addresses the problem of constructing bearing rigid networks in arbitrary dimensions. We first show that the bearing rigidity of a network is a generic property that is critically determined by the underlying graph of the network. A new notion termed generic bearing rigidity is defined for graphs. If the underlying graph of a network is generically bearing rigid, then the network is bearing rigid for almost all configurations; otherwise, the network is not bearing rigid for any configuration. As a result, the key to construct bearing rigid networks is to construct generically bearin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.04035","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":"1703.04035","created_at":"2026-05-18T00:36:51.246737+00:00"},{"alias_kind":"arxiv_version","alias_value":"1703.04035v2","created_at":"2026-05-18T00:36:51.246737+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.04035","created_at":"2026-05-18T00:36:51.246737+00:00"},{"alias_kind":"pith_short_12","alias_value":"Y2JF7B5QJEK6","created_at":"2026-05-18T12:31:56.362134+00:00"},{"alias_kind":"pith_short_16","alias_value":"Y2JF7B5QJEK6H7ZT","created_at":"2026-05-18T12:31:56.362134+00:00"},{"alias_kind":"pith_short_8","alias_value":"Y2JF7B5Q","created_at":"2026-05-18T12:31:56.362134+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/Y2JF7B5QJEK6H7ZTLPVO3DYE5Y","json":"https://pith.science/pith/Y2JF7B5QJEK6H7ZTLPVO3DYE5Y.json","graph_json":"https://pith.science/api/pith-number/Y2JF7B5QJEK6H7ZTLPVO3DYE5Y/graph.json","events_json":"https://pith.science/api/pith-number/Y2JF7B5QJEK6H7ZTLPVO3DYE5Y/events.json","paper":"https://pith.science/paper/Y2JF7B5Q"},"agent_actions":{"view_html":"https://pith.science/pith/Y2JF7B5QJEK6H7ZTLPVO3DYE5Y","download_json":"https://pith.science/pith/Y2JF7B5QJEK6H7ZTLPVO3DYE5Y.json","view_paper":"https://pith.science/paper/Y2JF7B5Q","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1703.04035&json=true","fetch_graph":"https://pith.science/api/pith-number/Y2JF7B5QJEK6H7ZTLPVO3DYE5Y/graph.json","fetch_events":"https://pith.science/api/pith-number/Y2JF7B5QJEK6H7ZTLPVO3DYE5Y/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Y2JF7B5QJEK6H7ZTLPVO3DYE5Y/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Y2JF7B5QJEK6H7ZTLPVO3DYE5Y/action/storage_attestation","attest_author":"https://pith.science/pith/Y2JF7B5QJEK6H7ZTLPVO3DYE5Y/action/author_attestation","sign_citation":"https://pith.science/pith/Y2JF7B5QJEK6H7ZTLPVO3DYE5Y/action/citation_signature","submit_replication":"https://pith.science/pith/Y2JF7B5QJEK6H7ZTLPVO3DYE5Y/action/replication_record"}},"created_at":"2026-05-18T00:36:51.246737+00:00","updated_at":"2026-05-18T00:36:51.246737+00:00"}