{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:ZET6WGHWLHSC2FNTQ3YSXIQZRT","short_pith_number":"pith:ZET6WGHW","schema_version":"1.0","canonical_sha256":"c927eb18f659e42d15b386f12ba2198ce4d3706904be317d5045ca2459eac26e","source":{"kind":"arxiv","id":"1710.01602","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1710.01602","created_at":"2026-05-18T00:33:42.297892+00:00"},{"alias_kind":"arxiv_version","alias_value":"1710.01602v1","created_at":"2026-05-18T00:33:42.297892+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.01602","created_at":"2026-05-18T00:33:42.297892+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZET6WGHWLHSC","created_at":"2026-05-18T12:31:59.375834+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZET6WGHWLHSC2FNT","created_at":"2026-05-18T12:31:59.375834+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZET6WGHW","created_at":"2026-05-18T12:31:59.375834+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/ZET6WGHWLHSC2FNTQ3YSXIQZRT","json":"https://pith.science/pith/ZET6WGHWLHSC2FNTQ3YSXIQZRT.json","graph_json":"https://pith.science/api/pith-number/ZET6WGHWLHSC2FNTQ3YSXIQZRT/graph.json","events_json":"https://pith.science/api/pith-number/ZET6WGHWLHSC2FNTQ3YSXIQZRT/events.json","paper":"https://pith.science/paper/ZET6WGHW"},"agent_actions":{"view_html":"https://pith.science/pith/ZET6WGHWLHSC2FNTQ3YSXIQZRT","download_json":"https://pith.science/pith/ZET6WGHWLHSC2FNTQ3YSXIQZRT.json","view_paper":"https://pith.science/paper/ZET6WGHW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1710.01602&json=true","fetch_graph":"https://pith.science/api/pith-number/ZET6WGHWLHSC2FNTQ3YSXIQZRT/graph.json","fetch_events":"https://pith.science/api/pith-number/ZET6WGHWLHSC2FNTQ3YSXIQZRT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZET6WGHWLHSC2FNTQ3YSXIQZRT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZET6WGHWLHSC2FNTQ3YSXIQZRT/action/storage_attestation","attest_author":"https://pith.science/pith/ZET6WGHWLHSC2FNTQ3YSXIQZRT/action/author_attestation","sign_citation":"https://pith.science/pith/ZET6WGHWLHSC2FNTQ3YSXIQZRT/action/citation_signature","submit_replication":"https://pith.science/pith/ZET6WGHWLHSC2FNTQ3YSXIQZRT/action/replication_record"}},"created_at":"2026-05-18T00:33:42.297892+00:00","updated_at":"2026-05-18T00:33:42.297892+00:00"}