{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:ZET6WGHWLHSC2FNTQ3YSXIQZRT","short_pith_number":"pith:ZET6WGHW","canonical_record":{"source":{"id":"1710.01602","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2017-10-04T13:45:00Z","cross_cats_sorted":[],"title_canon_sha256":"852989fcdf1be303162ec760e684baf3db5a3b0be0f45832bd8c829c05e9159b","abstract_canon_sha256":"4843177a89572d642714859fa88ca26e87fe0c12f43116fd398e63c56f6ad029"},"schema_version":"1.0"},"canonical_sha256":"c927eb18f659e42d15b386f12ba2198ce4d3706904be317d5045ca2459eac26e","source":{"kind":"arxiv","id":"1710.01602","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.01602","created_at":"2026-05-18T00:33:42Z"},{"alias_kind":"arxiv_version","alias_value":"1710.01602v1","created_at":"2026-05-18T00:33:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.01602","created_at":"2026-05-18T00:33:42Z"},{"alias_kind":"pith_short_12","alias_value":"ZET6WGHWLHSC","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_16","alias_value":"ZET6WGHWLHSC2FNT","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_8","alias_value":"ZET6WGHW","created_at":"2026-05-18T12:31:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:ZET6WGHWLHSC2FNTQ3YSXIQZRT","target":"record","payload":{"canonical_record":{"source":{"id":"1710.01602","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2017-10-04T13:45:00Z","cross_cats_sorted":[],"title_canon_sha256":"852989fcdf1be303162ec760e684baf3db5a3b0be0f45832bd8c829c05e9159b","abstract_canon_sha256":"4843177a89572d642714859fa88ca26e87fe0c12f43116fd398e63c56f6ad029"},"schema_version":"1.0"},"canonical_sha256":"c927eb18f659e42d15b386f12ba2198ce4d3706904be317d5045ca2459eac26e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:33:42.298330Z","signature_b64":"Ai5kfU+35wM7dXtPEchxpBIV9R+fYx3McM9buVLTo5fIyS1QxKb5Q/50tdPwlftu3LsM12E2ENeafgfRA61EDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c927eb18f659e42d15b386f12ba2198ce4d3706904be317d5045ca2459eac26e","last_reissued_at":"2026-05-18T00:33:42.297805Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:33:42.297805Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1710.01602","source_version":1,"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:33:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Zy572i3MLoXtfC3l7mepM1udp1tffUVRd3ksw5BNs7scxu44YpCMctOqV0yokcSRUWI2nJSzQK4kdmAQGZ7RBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T08:26:50.503377Z"},"content_sha256":"9f663b3680ed1e88998e552fbcf0420244e0653cdd0fe5ba32c2bf62d06b8b33","schema_version":"1.0","event_id":"sha256:9f663b3680ed1e88998e552fbcf0420244e0653cdd0fe5ba32c2bf62d06b8b33"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:ZET6WGHWLHSC2FNTQ3YSXIQZRT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"GraphMatch: Efficient Large-Scale Graph Construction for Structure from Motion","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Chris Sweeney, Pradeep Sen, Qiaodong Cui, Victor Fragoso","submitted_at":"2017-10-04T13:45:00Z","abstract_excerpt":"We present GraphMatch, an approximate yet efficient method for building the matching graph for large-scale structure-from-motion (SfM) pipelines. Unlike modern SfM pipelines that use vocabulary (Voc.) trees to quickly build the matching graph and avoid a costly brute-force search of matching image pairs, GraphMatch does not require an expensive offline pre-processing phase to construct a Voc. tree. Instead, GraphMatch leverages two priors that can predict which image pairs are likely to match, thereby making the matching process for SfM much more efficient. The first is a score computed from t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.01602","kind":"arxiv","version":1},"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:33:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dKy1Cwzmt4phHux096HPehBCiHpbOVwhmtdmBQDF3g1G5zqeSoUiKpnFyUxPon3f/vHFklG+hh2mw+0XvUvBCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T08:26:50.503723Z"},"content_sha256":"51266a08aa9af5c8b27735a4b08c1df7a95fd5a4f4781a92a5cbca8f3c78dab5","schema_version":"1.0","event_id":"sha256:51266a08aa9af5c8b27735a4b08c1df7a95fd5a4f4781a92a5cbca8f3c78dab5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZET6WGHWLHSC2FNTQ3YSXIQZRT/bundle.json","state_url":"https://pith.science/pith/ZET6WGHWLHSC2FNTQ3YSXIQZRT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZET6WGHWLHSC2FNTQ3YSXIQZRT/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-06-05T08:26:50Z","links":{"resolver":"https://pith.science/pith/ZET6WGHWLHSC2FNTQ3YSXIQZRT","bundle":"https://pith.science/pith/ZET6WGHWLHSC2FNTQ3YSXIQZRT/bundle.json","state":"https://pith.science/pith/ZET6WGHWLHSC2FNTQ3YSXIQZRT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZET6WGHWLHSC2FNTQ3YSXIQZRT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:ZET6WGHWLHSC2FNTQ3YSXIQZRT","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":"4843177a89572d642714859fa88ca26e87fe0c12f43116fd398e63c56f6ad029","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2017-10-04T13:45:00Z","title_canon_sha256":"852989fcdf1be303162ec760e684baf3db5a3b0be0f45832bd8c829c05e9159b"},"schema_version":"1.0","source":{"id":"1710.01602","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.01602","created_at":"2026-05-18T00:33:42Z"},{"alias_kind":"arxiv_version","alias_value":"1710.01602v1","created_at":"2026-05-18T00:33:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.01602","created_at":"2026-05-18T00:33:42Z"},{"alias_kind":"pith_short_12","alias_value":"ZET6WGHWLHSC","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_16","alias_value":"ZET6WGHWLHSC2FNT","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_8","alias_value":"ZET6WGHW","created_at":"2026-05-18T12:31:59Z"}],"graph_snapshots":[{"event_id":"sha256:51266a08aa9af5c8b27735a4b08c1df7a95fd5a4f4781a92a5cbca8f3c78dab5","target":"graph","created_at":"2026-05-18T00:33:42Z","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":"We present GraphMatch, an approximate yet efficient method for building the matching graph for large-scale structure-from-motion (SfM) pipelines. Unlike modern SfM pipelines that use vocabulary (Voc.) trees to quickly build the matching graph and avoid a costly brute-force search of matching image pairs, GraphMatch does not require an expensive offline pre-processing phase to construct a Voc. tree. Instead, GraphMatch leverages two priors that can predict which image pairs are likely to match, thereby making the matching process for SfM much more efficient. The first is a score computed from t","authors_text":"Chris Sweeney, Pradeep Sen, Qiaodong Cui, Victor Fragoso","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2017-10-04T13:45:00Z","title":"GraphMatch: Efficient Large-Scale Graph Construction for Structure from Motion"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.01602","kind":"arxiv","version":1},"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:9f663b3680ed1e88998e552fbcf0420244e0653cdd0fe5ba32c2bf62d06b8b33","target":"record","created_at":"2026-05-18T00:33:42Z","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":"4843177a89572d642714859fa88ca26e87fe0c12f43116fd398e63c56f6ad029","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2017-10-04T13:45:00Z","title_canon_sha256":"852989fcdf1be303162ec760e684baf3db5a3b0be0f45832bd8c829c05e9159b"},"schema_version":"1.0","source":{"id":"1710.01602","kind":"arxiv","version":1}},"canonical_sha256":"c927eb18f659e42d15b386f12ba2198ce4d3706904be317d5045ca2459eac26e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c927eb18f659e42d15b386f12ba2198ce4d3706904be317d5045ca2459eac26e","first_computed_at":"2026-05-18T00:33:42.297805Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:33:42.297805Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Ai5kfU+35wM7dXtPEchxpBIV9R+fYx3McM9buVLTo5fIyS1QxKb5Q/50tdPwlftu3LsM12E2ENeafgfRA61EDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:33:42.298330Z","signed_message":"canonical_sha256_bytes"},"source_id":"1710.01602","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9f663b3680ed1e88998e552fbcf0420244e0653cdd0fe5ba32c2bf62d06b8b33","sha256:51266a08aa9af5c8b27735a4b08c1df7a95fd5a4f4781a92a5cbca8f3c78dab5"],"state_sha256":"41878c4e7e3d4644d939e97bb47ced0dec317468f9900eee450aee38a749a4df"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EjGaBImQTcR052zBGXFot2UdGgJm2p71m+/dFNBC+9qY99LsVjWQkTvZA/33Oo3wbvmh+Jf7GJt2QbWqOSEZAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T08:26:50.505662Z","bundle_sha256":"4cb7bd280d3f5bd397115be1df5be083f4fce8120ae04395297cb5e727ac6086"}}