{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:Y2JF7B5QJEK6H7ZTLPVO3DYE5Y","short_pith_number":"pith:Y2JF7B5Q","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"},"canonical_sha256":"c6925f87b04915e3ff335beaed8f04ee3c97b3a17b33ff8c25bd663699a95d3d","source":{"kind":"arxiv","id":"1703.04035","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.04035","created_at":"2026-05-18T00:36:51Z"},{"alias_kind":"arxiv_version","alias_value":"1703.04035v2","created_at":"2026-05-18T00:36:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.04035","created_at":"2026-05-18T00:36:51Z"},{"alias_kind":"pith_short_12","alias_value":"Y2JF7B5QJEK6","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_16","alias_value":"Y2JF7B5QJEK6H7ZT","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_8","alias_value":"Y2JF7B5Q","created_at":"2026-05-18T12:31:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:Y2JF7B5QJEK6H7ZTLPVO3DYE5Y","target":"record","payload":{"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"},"canonical_sha256":"c6925f87b04915e3ff335beaed8f04ee3c97b3a17b33ff8c25bd663699a95d3d","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"},"source_kind":"arxiv","source_id":"1703.04035","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:36:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Nj8xZm3oQjYOcnDqK4aZIZfxMPU5zYzKX4xba0EQK6DhuaiNSV5zB5f0pRs7lSPN1cufipz7XIIzhkNLAhCpBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T18:25:08.785147Z"},"content_sha256":"923fe2d20a092512aa34eb7038d1f27a187ba4c0e3115bd6093a0ab324b09536","schema_version":"1.0","event_id":"sha256:923fe2d20a092512aa34eb7038d1f27a187ba4c0e3115bd6093a0ab324b09536"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:Y2JF7B5QJEK6H7ZTLPVO3DYE5Y","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:36:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EKXPOuqfmht9WkDMNBBPTXCO9nHRhO5uyBS53fY8MDk/2u06+GRgtRYqzHCe7z3lWPy5ldeYB13k7XYfiE4RDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T18:25:08.785837Z"},"content_sha256":"af1803d691beb612210cb503fbe277ec52671eb83a7c5339014c79b8e4ad32d1","schema_version":"1.0","event_id":"sha256:af1803d691beb612210cb503fbe277ec52671eb83a7c5339014c79b8e4ad32d1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Y2JF7B5QJEK6H7ZTLPVO3DYE5Y/bundle.json","state_url":"https://pith.science/pith/Y2JF7B5QJEK6H7ZTLPVO3DYE5Y/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Y2JF7B5QJEK6H7ZTLPVO3DYE5Y/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-29T18:25:08Z","links":{"resolver":"https://pith.science/pith/Y2JF7B5QJEK6H7ZTLPVO3DYE5Y","bundle":"https://pith.science/pith/Y2JF7B5QJEK6H7ZTLPVO3DYE5Y/bundle.json","state":"https://pith.science/pith/Y2JF7B5QJEK6H7ZTLPVO3DYE5Y/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Y2JF7B5QJEK6H7ZTLPVO3DYE5Y/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:Y2JF7B5QJEK6H7ZTLPVO3DYE5Y","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"cbeda095d9efe12d4cff2c92839e01a8ba7c4b5fa92a00e3369d3a8c10dddc12","cross_cats_sorted":["math.CO","math.MG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2017-03-11T22:33:04Z","title_canon_sha256":"d928a5c0861793dee71902b389d49c72d0792c4bc9a7744b264a47560a14ec0b"},"schema_version":"1.0","source":{"id":"1703.04035","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.04035","created_at":"2026-05-18T00:36:51Z"},{"alias_kind":"arxiv_version","alias_value":"1703.04035v2","created_at":"2026-05-18T00:36:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.04035","created_at":"2026-05-18T00:36:51Z"},{"alias_kind":"pith_short_12","alias_value":"Y2JF7B5QJEK6","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_16","alias_value":"Y2JF7B5QJEK6H7ZT","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_8","alias_value":"Y2JF7B5Q","created_at":"2026-05-18T12:31:56Z"}],"graph_snapshots":[{"event_id":"sha256:af1803d691beb612210cb503fbe277ec52671eb83a7c5339014c79b8e4ad32d1","target":"graph","created_at":"2026-05-18T00:36:51Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Daniel Zelazo, Hyo-Sung Ahn, Minh-Hoang Trinh, Shiyu Zhao, Zhiyong Sun","cross_cats":["math.CO","math.MG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2017-03-11T22:33:04Z","title":"Laman Graphs are Generically Bearing Rigid in Arbitrary Dimensions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.04035","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:923fe2d20a092512aa34eb7038d1f27a187ba4c0e3115bd6093a0ab324b09536","target":"record","created_at":"2026-05-18T00:36:51Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"cbeda095d9efe12d4cff2c92839e01a8ba7c4b5fa92a00e3369d3a8c10dddc12","cross_cats_sorted":["math.CO","math.MG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2017-03-11T22:33:04Z","title_canon_sha256":"d928a5c0861793dee71902b389d49c72d0792c4bc9a7744b264a47560a14ec0b"},"schema_version":"1.0","source":{"id":"1703.04035","kind":"arxiv","version":2}},"canonical_sha256":"c6925f87b04915e3ff335beaed8f04ee3c97b3a17b33ff8c25bd663699a95d3d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c6925f87b04915e3ff335beaed8f04ee3c97b3a17b33ff8c25bd663699a95d3d","first_computed_at":"2026-05-18T00:36:51.246638Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:36:51.246638Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"g8DWwEAEuEH+/TB6zwh/NBNsfAvdIG7NuEBKLL0O0yBnjGWh0a7X9Si7C0AvfWPyW9kbCpD3hRYAQYQj6Nd2Cg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:36:51.247194Z","signed_message":"canonical_sha256_bytes"},"source_id":"1703.04035","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:923fe2d20a092512aa34eb7038d1f27a187ba4c0e3115bd6093a0ab324b09536","sha256:af1803d691beb612210cb503fbe277ec52671eb83a7c5339014c79b8e4ad32d1"],"state_sha256":"7eb28fc4b22983debe46029b77b1985a3ec2133d4cebd1677f23234caaa082bd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"r17zolFpfsbK08IZ6m0CHkdjXNmlLwYkU+VNn5GzqPohPgT2874sF7YAYtPHu05ydMzefnuAZ+Z+XGax7+0sDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-29T18:25:08.789572Z","bundle_sha256":"b2c19c42001aab5a0a9234673b5f6cf434a1a2253e3b3bc4de6705a2661a7a62"}}