{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:C6CG4VNFRZSC3GAWXE77DET7CC","short_pith_number":"pith:C6CG4VNF","canonical_record":{"source":{"id":"1207.7160","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2012-07-31T04:05:42Z","cross_cats_sorted":[],"title_canon_sha256":"f9dc89d25640e398d36055b9642e9fa2d0f731edf991dee716123f17dc4fc980","abstract_canon_sha256":"2281433b8c68014ce6e8fb9be42d8a0b16407d21e5e33b487ded8e2a996ea085"},"schema_version":"1.0"},"canonical_sha256":"17846e55a58e642d9816b93ff1927f108b67c5d73011d72df2efd111a78bed74","source":{"kind":"arxiv","id":"1207.7160","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.7160","created_at":"2026-05-18T03:49:11Z"},{"alias_kind":"arxiv_version","alias_value":"1207.7160v2","created_at":"2026-05-18T03:49:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.7160","created_at":"2026-05-18T03:49:11Z"},{"alias_kind":"pith_short_12","alias_value":"C6CG4VNFRZSC","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_16","alias_value":"C6CG4VNFRZSC3GAW","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_8","alias_value":"C6CG4VNF","created_at":"2026-05-18T12:27:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:C6CG4VNFRZSC3GAWXE77DET7CC","target":"record","payload":{"canonical_record":{"source":{"id":"1207.7160","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2012-07-31T04:05:42Z","cross_cats_sorted":[],"title_canon_sha256":"f9dc89d25640e398d36055b9642e9fa2d0f731edf991dee716123f17dc4fc980","abstract_canon_sha256":"2281433b8c68014ce6e8fb9be42d8a0b16407d21e5e33b487ded8e2a996ea085"},"schema_version":"1.0"},"canonical_sha256":"17846e55a58e642d9816b93ff1927f108b67c5d73011d72df2efd111a78bed74","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:49:11.472086Z","signature_b64":"GQZ/yiFFvrV4k6nB+ByfNa1fzXy2YrGxydlH0RRP7k90lOXhpNk2O/gy/uDotmzvLbEbhaYdZs5QLvPZJVJeAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"17846e55a58e642d9816b93ff1927f108b67c5d73011d72df2efd111a78bed74","last_reissued_at":"2026-05-18T03:49:11.471647Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:49:11.471647Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1207.7160","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-18T03:49:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1dqmQ72qLD7bdznR3llYPWwJQDoylyrDvkHQV+W188VRYXhRvcj6kGLGDIRuFILy7l7T114TtPT0qYwwXDarAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T11:34:15.288645Z"},"content_sha256":"9617f788999b8a7ebbf91f8256ea2baf42c8f63e26879e526bddcca3a1516adc","schema_version":"1.0","event_id":"sha256:9617f788999b8a7ebbf91f8256ea2baf42c8f63e26879e526bddcca3a1516adc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:C6CG4VNFRZSC3GAWXE77DET7CC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A QCQP Approach to Triangulation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Chris Aholt, Rekha Thomas, Sameer Agarwal","submitted_at":"2012-07-31T04:05:42Z","abstract_excerpt":"Triangulation of a three-dimensional point from at least two noisy 2-D images can be formulated as a quadratically constrained quadratic program. We propose an algorithm to extract candidate solutions to this problem from its semidefinite programming relaxations. We then describe a sufficient condition and a polynomial time test for certifying when such a solution is optimal. This test has no false positives. Experiments indicate that false negatives are rare, and the algorithm has excellent performance in practice. We explain this phenomenon in terms of the geometry of the triangulation probl"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.7160","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-18T03:49:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gXi6Mztx5dOoZM8xio5wGQyxO5mIODoRROwduVZHNb2e5+BWoJdRCjOFNmDKGB02vSS/P+bKM4uy8XmYm/7xBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T11:34:15.289327Z"},"content_sha256":"8a2a4bf12b1005b9e3b53f7b51c8b3e23b5987baf2474d09f0449c8145583480","schema_version":"1.0","event_id":"sha256:8a2a4bf12b1005b9e3b53f7b51c8b3e23b5987baf2474d09f0449c8145583480"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/C6CG4VNFRZSC3GAWXE77DET7CC/bundle.json","state_url":"https://pith.science/pith/C6CG4VNFRZSC3GAWXE77DET7CC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/C6CG4VNFRZSC3GAWXE77DET7CC/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-22T11:34:15Z","links":{"resolver":"https://pith.science/pith/C6CG4VNFRZSC3GAWXE77DET7CC","bundle":"https://pith.science/pith/C6CG4VNFRZSC3GAWXE77DET7CC/bundle.json","state":"https://pith.science/pith/C6CG4VNFRZSC3GAWXE77DET7CC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/C6CG4VNFRZSC3GAWXE77DET7CC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:C6CG4VNFRZSC3GAWXE77DET7CC","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":"2281433b8c68014ce6e8fb9be42d8a0b16407d21e5e33b487ded8e2a996ea085","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2012-07-31T04:05:42Z","title_canon_sha256":"f9dc89d25640e398d36055b9642e9fa2d0f731edf991dee716123f17dc4fc980"},"schema_version":"1.0","source":{"id":"1207.7160","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.7160","created_at":"2026-05-18T03:49:11Z"},{"alias_kind":"arxiv_version","alias_value":"1207.7160v2","created_at":"2026-05-18T03:49:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.7160","created_at":"2026-05-18T03:49:11Z"},{"alias_kind":"pith_short_12","alias_value":"C6CG4VNFRZSC","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_16","alias_value":"C6CG4VNFRZSC3GAW","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_8","alias_value":"C6CG4VNF","created_at":"2026-05-18T12:27:01Z"}],"graph_snapshots":[{"event_id":"sha256:8a2a4bf12b1005b9e3b53f7b51c8b3e23b5987baf2474d09f0449c8145583480","target":"graph","created_at":"2026-05-18T03:49:11Z","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":"Triangulation of a three-dimensional point from at least two noisy 2-D images can be formulated as a quadratically constrained quadratic program. We propose an algorithm to extract candidate solutions to this problem from its semidefinite programming relaxations. We then describe a sufficient condition and a polynomial time test for certifying when such a solution is optimal. This test has no false positives. Experiments indicate that false negatives are rare, and the algorithm has excellent performance in practice. We explain this phenomenon in terms of the geometry of the triangulation probl","authors_text":"Chris Aholt, Rekha Thomas, Sameer Agarwal","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2012-07-31T04:05:42Z","title":"A QCQP Approach to Triangulation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.7160","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:9617f788999b8a7ebbf91f8256ea2baf42c8f63e26879e526bddcca3a1516adc","target":"record","created_at":"2026-05-18T03:49:11Z","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":"2281433b8c68014ce6e8fb9be42d8a0b16407d21e5e33b487ded8e2a996ea085","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2012-07-31T04:05:42Z","title_canon_sha256":"f9dc89d25640e398d36055b9642e9fa2d0f731edf991dee716123f17dc4fc980"},"schema_version":"1.0","source":{"id":"1207.7160","kind":"arxiv","version":2}},"canonical_sha256":"17846e55a58e642d9816b93ff1927f108b67c5d73011d72df2efd111a78bed74","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"17846e55a58e642d9816b93ff1927f108b67c5d73011d72df2efd111a78bed74","first_computed_at":"2026-05-18T03:49:11.471647Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:49:11.471647Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"GQZ/yiFFvrV4k6nB+ByfNa1fzXy2YrGxydlH0RRP7k90lOXhpNk2O/gy/uDotmzvLbEbhaYdZs5QLvPZJVJeAA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:49:11.472086Z","signed_message":"canonical_sha256_bytes"},"source_id":"1207.7160","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9617f788999b8a7ebbf91f8256ea2baf42c8f63e26879e526bddcca3a1516adc","sha256:8a2a4bf12b1005b9e3b53f7b51c8b3e23b5987baf2474d09f0449c8145583480"],"state_sha256":"8fd4f6a013fe3356b17c8f4326bcc8ce27bf95e6333c347d35f9de1365ecd1b7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"h4AA0tjbc16V7gmaJDs9hFXV9+RUIVF1XMcZ0GjAOp+1HhvAMtkbzmMUfypwaAimNkLIpy14BSpzbTwkjXjLAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-22T11:34:15.292113Z","bundle_sha256":"4ef5f5c785851e84e833326edf24fdd6ffe98e454087c66082a6e213758871ae"}}