{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:KSL3U47KNFKSMAPCQSYEFWPEC3","short_pith_number":"pith:KSL3U47K","schema_version":"1.0","canonical_sha256":"5497ba73ea69552601e284b042d9e416e4d5f9cc9dc0195560e79b5552fe49bf","source":{"kind":"arxiv","id":"1503.02619","version":2},"attestation_state":"computed","paper":{"title":"MODS: Fast and Robust Method for Two-View Matching","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Dmytro Mishkin, Jiri Matas, Michal Perdoch","submitted_at":"2015-03-09T18:59:18Z","abstract_excerpt":"A novel algorithm for wide-baseline matching called MODS - Matching On Demand with view Synthesis - is presented. The MODS algorithm is experimentally shown to solve a broader range of wide-baseline problems than the state of the art while being nearly as fast as standard matchers on simple problems. The apparent robustness vs. speed trade-off is finessed by the use of progressively more time-consuming feature detectors and by on-demand generation of synthesized images that is performed until a reliable estimate of geometry is obtained.\n  We introduce an improved method for tentative correspon"},"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":"1503.02619","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2015-03-09T18:59:18Z","cross_cats_sorted":[],"title_canon_sha256":"a91a0aa2c4ef4c930879760d41420d2326de515ead2fad32fb12a4ee9a90f7d5","abstract_canon_sha256":"732785b612d47fec6a41fa2ffb50a0ade65afd42457114387059d574cb84d1a9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:15:58.813727Z","signature_b64":"oT3hAfh9sR11dILFHrps07LhRe4ESlcuWi3+4kaKy/yvCfPwJsj18uM3ZyO1GVEQFrVHr5dVQqsynprEKiduDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5497ba73ea69552601e284b042d9e416e4d5f9cc9dc0195560e79b5552fe49bf","last_reissued_at":"2026-05-18T01:15:58.813165Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:15:58.813165Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"MODS: Fast and Robust Method for Two-View Matching","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Dmytro Mishkin, Jiri Matas, Michal Perdoch","submitted_at":"2015-03-09T18:59:18Z","abstract_excerpt":"A novel algorithm for wide-baseline matching called MODS - Matching On Demand with view Synthesis - is presented. The MODS algorithm is experimentally shown to solve a broader range of wide-baseline problems than the state of the art while being nearly as fast as standard matchers on simple problems. The apparent robustness vs. speed trade-off is finessed by the use of progressively more time-consuming feature detectors and by on-demand generation of synthesized images that is performed until a reliable estimate of geometry is obtained.\n  We introduce an improved method for tentative correspon"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.02619","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1503.02619","created_at":"2026-05-18T01:15:58.813246+00:00"},{"alias_kind":"arxiv_version","alias_value":"1503.02619v2","created_at":"2026-05-18T01:15:58.813246+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.02619","created_at":"2026-05-18T01:15:58.813246+00:00"},{"alias_kind":"pith_short_12","alias_value":"KSL3U47KNFKS","created_at":"2026-05-18T12:29:29.992203+00:00"},{"alias_kind":"pith_short_16","alias_value":"KSL3U47KNFKSMAPC","created_at":"2026-05-18T12:29:29.992203+00:00"},{"alias_kind":"pith_short_8","alias_value":"KSL3U47K","created_at":"2026-05-18T12:29:29.992203+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/KSL3U47KNFKSMAPCQSYEFWPEC3","json":"https://pith.science/pith/KSL3U47KNFKSMAPCQSYEFWPEC3.json","graph_json":"https://pith.science/api/pith-number/KSL3U47KNFKSMAPCQSYEFWPEC3/graph.json","events_json":"https://pith.science/api/pith-number/KSL3U47KNFKSMAPCQSYEFWPEC3/events.json","paper":"https://pith.science/paper/KSL3U47K"},"agent_actions":{"view_html":"https://pith.science/pith/KSL3U47KNFKSMAPCQSYEFWPEC3","download_json":"https://pith.science/pith/KSL3U47KNFKSMAPCQSYEFWPEC3.json","view_paper":"https://pith.science/paper/KSL3U47K","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1503.02619&json=true","fetch_graph":"https://pith.science/api/pith-number/KSL3U47KNFKSMAPCQSYEFWPEC3/graph.json","fetch_events":"https://pith.science/api/pith-number/KSL3U47KNFKSMAPCQSYEFWPEC3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KSL3U47KNFKSMAPCQSYEFWPEC3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KSL3U47KNFKSMAPCQSYEFWPEC3/action/storage_attestation","attest_author":"https://pith.science/pith/KSL3U47KNFKSMAPCQSYEFWPEC3/action/author_attestation","sign_citation":"https://pith.science/pith/KSL3U47KNFKSMAPCQSYEFWPEC3/action/citation_signature","submit_replication":"https://pith.science/pith/KSL3U47KNFKSMAPCQSYEFWPEC3/action/replication_record"}},"created_at":"2026-05-18T01:15:58.813246+00:00","updated_at":"2026-05-18T01:15:58.813246+00:00"}