{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:UBXYLC6UPGFOXTSNHYZRFIZ2F7","short_pith_number":"pith:UBXYLC6U","canonical_record":{"source":{"id":"1111.3304","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CE","submitted_at":"2011-11-09T17:38:16Z","cross_cats_sorted":["cs.DS","math.CO","q-bio.QM"],"title_canon_sha256":"ffc63ca16c58c20516770c8b10e96625de51232607751f7d5ca6e91d0f3009b1","abstract_canon_sha256":"30ad9cff68ac7aa4b7e69ff30f86d25e083193f8bd83dfcaa7be81287e6e57a5"},"schema_version":"1.0"},"canonical_sha256":"a06f858bd4798aebce4d3e3312a33a2fe102f29b898b930ac5537c03ab8da6c2","source":{"kind":"arxiv","id":"1111.3304","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1111.3304","created_at":"2026-05-18T00:28:08Z"},{"alias_kind":"arxiv_version","alias_value":"1111.3304v3","created_at":"2026-05-18T00:28:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.3304","created_at":"2026-05-18T00:28:08Z"},{"alias_kind":"pith_short_12","alias_value":"UBXYLC6UPGFO","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_16","alias_value":"UBXYLC6UPGFOXTSN","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_8","alias_value":"UBXYLC6U","created_at":"2026-05-18T12:26:42Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:UBXYLC6UPGFOXTSNHYZRFIZ2F7","target":"record","payload":{"canonical_record":{"source":{"id":"1111.3304","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CE","submitted_at":"2011-11-09T17:38:16Z","cross_cats_sorted":["cs.DS","math.CO","q-bio.QM"],"title_canon_sha256":"ffc63ca16c58c20516770c8b10e96625de51232607751f7d5ca6e91d0f3009b1","abstract_canon_sha256":"30ad9cff68ac7aa4b7e69ff30f86d25e083193f8bd83dfcaa7be81287e6e57a5"},"schema_version":"1.0"},"canonical_sha256":"a06f858bd4798aebce4d3e3312a33a2fe102f29b898b930ac5537c03ab8da6c2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:28:08.015425Z","signature_b64":"BvNkVBS2ZCcxYeqLScV3JvxpUJtznzqD3RLZxc7y/7VosabRTSIZlkqeoMSmOC1w05dOxxzsfcrldY3zDM6dDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a06f858bd4798aebce4d3e3312a33a2fe102f29b898b930ac5537c03ab8da6c2","last_reissued_at":"2026-05-18T00:28:08.014737Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:28:08.014737Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1111.3304","source_version":3,"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:28:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PPqVXkAWA5OIN05Nw9LVWveQvFEZHKUAVDUJcd6dTH1/ftVSenyiS+cIM4pLolSSoqf2sTu2BHSD3yA5j2ZPCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T19:09:45.608497Z"},"content_sha256":"b8b3546d8a643cd91d58c285a6aa9039e23f98185f687ad2a9f8d5cf630acf22","schema_version":"1.0","event_id":"sha256:b8b3546d8a643cd91d58c285a6aa9039e23f98185f687ad2a9f8d5cf630acf22"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:UBXYLC6UPGFOXTSNHYZRFIZ2F7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Eigenvector Synchronization, Graph Rigidity and the Molecule Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.CO","q-bio.QM"],"primary_cat":"cs.CE","authors_text":"Amit Singer, David Cowburn, Mihai Cucuringu","submitted_at":"2011-11-09T17:38:16Z","abstract_excerpt":"The graph realization problem has received a great deal of attention in recent years, due to its importance in applications such as wireless sensor networks and structural biology. In this paper, we extend on previous work and propose the 3D-ASAP algorithm, for the graph realization problem in $\\mathbb{R}^3$, given a sparse and noisy set of distance measurements. 3D-ASAP is a divide and conquer, non-incremental and non-iterative algorithm, which integrates local distance information into a global structure determination. Our approach starts with identifying, for every node, a subgraph of its 1"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1111.3304","kind":"arxiv","version":3},"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:28:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RUOfLoJemMIH5tfK+3AGffu2cdyLlpmA1BjOwdWfDWo5UMeBcTKcaU3AJTY5BB4NWnxUPYb0NDEsFrjqnq5dCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T19:09:45.608865Z"},"content_sha256":"cf86ab5ac1a2088ef6dd2ca9f16ec33c2b59ca81b9e0078b8b1df1ef0e6d2150","schema_version":"1.0","event_id":"sha256:cf86ab5ac1a2088ef6dd2ca9f16ec33c2b59ca81b9e0078b8b1df1ef0e6d2150"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UBXYLC6UPGFOXTSNHYZRFIZ2F7/bundle.json","state_url":"https://pith.science/pith/UBXYLC6UPGFOXTSNHYZRFIZ2F7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UBXYLC6UPGFOXTSNHYZRFIZ2F7/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-28T19:09:45Z","links":{"resolver":"https://pith.science/pith/UBXYLC6UPGFOXTSNHYZRFIZ2F7","bundle":"https://pith.science/pith/UBXYLC6UPGFOXTSNHYZRFIZ2F7/bundle.json","state":"https://pith.science/pith/UBXYLC6UPGFOXTSNHYZRFIZ2F7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UBXYLC6UPGFOXTSNHYZRFIZ2F7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:UBXYLC6UPGFOXTSNHYZRFIZ2F7","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":"30ad9cff68ac7aa4b7e69ff30f86d25e083193f8bd83dfcaa7be81287e6e57a5","cross_cats_sorted":["cs.DS","math.CO","q-bio.QM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CE","submitted_at":"2011-11-09T17:38:16Z","title_canon_sha256":"ffc63ca16c58c20516770c8b10e96625de51232607751f7d5ca6e91d0f3009b1"},"schema_version":"1.0","source":{"id":"1111.3304","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1111.3304","created_at":"2026-05-18T00:28:08Z"},{"alias_kind":"arxiv_version","alias_value":"1111.3304v3","created_at":"2026-05-18T00:28:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.3304","created_at":"2026-05-18T00:28:08Z"},{"alias_kind":"pith_short_12","alias_value":"UBXYLC6UPGFO","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_16","alias_value":"UBXYLC6UPGFOXTSN","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_8","alias_value":"UBXYLC6U","created_at":"2026-05-18T12:26:42Z"}],"graph_snapshots":[{"event_id":"sha256:cf86ab5ac1a2088ef6dd2ca9f16ec33c2b59ca81b9e0078b8b1df1ef0e6d2150","target":"graph","created_at":"2026-05-18T00:28:08Z","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":"The graph realization problem has received a great deal of attention in recent years, due to its importance in applications such as wireless sensor networks and structural biology. In this paper, we extend on previous work and propose the 3D-ASAP algorithm, for the graph realization problem in $\\mathbb{R}^3$, given a sparse and noisy set of distance measurements. 3D-ASAP is a divide and conquer, non-incremental and non-iterative algorithm, which integrates local distance information into a global structure determination. Our approach starts with identifying, for every node, a subgraph of its 1","authors_text":"Amit Singer, David Cowburn, Mihai Cucuringu","cross_cats":["cs.DS","math.CO","q-bio.QM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CE","submitted_at":"2011-11-09T17:38:16Z","title":"Eigenvector Synchronization, Graph Rigidity and the Molecule Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1111.3304","kind":"arxiv","version":3},"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:b8b3546d8a643cd91d58c285a6aa9039e23f98185f687ad2a9f8d5cf630acf22","target":"record","created_at":"2026-05-18T00:28:08Z","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":"30ad9cff68ac7aa4b7e69ff30f86d25e083193f8bd83dfcaa7be81287e6e57a5","cross_cats_sorted":["cs.DS","math.CO","q-bio.QM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CE","submitted_at":"2011-11-09T17:38:16Z","title_canon_sha256":"ffc63ca16c58c20516770c8b10e96625de51232607751f7d5ca6e91d0f3009b1"},"schema_version":"1.0","source":{"id":"1111.3304","kind":"arxiv","version":3}},"canonical_sha256":"a06f858bd4798aebce4d3e3312a33a2fe102f29b898b930ac5537c03ab8da6c2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a06f858bd4798aebce4d3e3312a33a2fe102f29b898b930ac5537c03ab8da6c2","first_computed_at":"2026-05-18T00:28:08.014737Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:28:08.014737Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"BvNkVBS2ZCcxYeqLScV3JvxpUJtznzqD3RLZxc7y/7VosabRTSIZlkqeoMSmOC1w05dOxxzsfcrldY3zDM6dDw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:28:08.015425Z","signed_message":"canonical_sha256_bytes"},"source_id":"1111.3304","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b8b3546d8a643cd91d58c285a6aa9039e23f98185f687ad2a9f8d5cf630acf22","sha256:cf86ab5ac1a2088ef6dd2ca9f16ec33c2b59ca81b9e0078b8b1df1ef0e6d2150"],"state_sha256":"bd168b624d6020025ebc0626fae75bbb055104dfd4b3e2b8133e0087143728e0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3ex6PbOwgHhFwE5DhzMFirQTsZsZopYEf1Pde/KTv5ij3S4TD96EptKMjxdSRcM9ohpHAfsv+Y5JwIAOlBWpAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T19:09:45.610925Z","bundle_sha256":"bd658a71ea95c88e8fb393b4769df92938cd9c4dc291f0239faffbecb188d485"}}