{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:BTP6UC7QR5LY5GKPO3DZUJOLGO","short_pith_number":"pith:BTP6UC7Q","schema_version":"1.0","canonical_sha256":"0cdfea0bf08f578e994f76c79a25cb33a28fdcdaf1f1036ac811bb4cd0d59f36","source":{"kind":"arxiv","id":"1908.02021","version":3},"attestation_state":"computed","paper":{"title":"Consensus Maximization Tree Search Revisited","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Tat-Jun Chin, Vladlen Koltun, Zhipeng Cai","submitted_at":"2019-08-06T08:54:04Z","abstract_excerpt":"Consensus maximization is widely used for robust fitting in computer vision. However, solving it exactly, i.e., finding the globally optimal solution, is intractable. A* tree search, which has been shown to be fixed-parameter tractable, is one of the most efficient exact methods, though it is still limited to small inputs. We make two key contributions towards improving A* tree search. First, we show that the consensus maximization tree structure used previously actually contains paths that connect nodes at both adjacent and non-adjacent levels. Crucially, paths connecting non-adjacent levels "},"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":"1908.02021","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-08-06T08:54:04Z","cross_cats_sorted":[],"title_canon_sha256":"7b886531dca4f5aaeb86eed12862a8c64b8a87ec641662dbf0101c6232ae7557","abstract_canon_sha256":"6303b8b7c3ed949350fa4bf6bfbc12ecfc09e9de84adda415e6809c923759b45"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T23:59:34.352055Z","signature_b64":"3Ntm/rGAd/D0/rwwh71r9mNFsynXoSYvWhbIh3SOLd1Qyq5XxeILL7DnWE/jmsAdW3dPiHjBHECiDREkfCfaAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0cdfea0bf08f578e994f76c79a25cb33a28fdcdaf1f1036ac811bb4cd0d59f36","last_reissued_at":"2026-07-04T23:59:34.351658Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T23:59:34.351658Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Consensus Maximization Tree Search Revisited","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Tat-Jun Chin, Vladlen Koltun, Zhipeng Cai","submitted_at":"2019-08-06T08:54:04Z","abstract_excerpt":"Consensus maximization is widely used for robust fitting in computer vision. However, solving it exactly, i.e., finding the globally optimal solution, is intractable. A* tree search, which has been shown to be fixed-parameter tractable, is one of the most efficient exact methods, though it is still limited to small inputs. We make two key contributions towards improving A* tree search. First, we show that the consensus maximization tree structure used previously actually contains paths that connect nodes at both adjacent and non-adjacent levels. Crucially, paths connecting non-adjacent levels "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.02021","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1908.02021/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"1908.02021","created_at":"2026-07-04T23:59:34.351720+00:00"},{"alias_kind":"arxiv_version","alias_value":"1908.02021v3","created_at":"2026-07-04T23:59:34.351720+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.02021","created_at":"2026-07-04T23:59:34.351720+00:00"},{"alias_kind":"pith_short_12","alias_value":"BTP6UC7QR5LY","created_at":"2026-07-04T23:59:34.351720+00:00"},{"alias_kind":"pith_short_16","alias_value":"BTP6UC7QR5LY5GKP","created_at":"2026-07-04T23:59:34.351720+00:00"},{"alias_kind":"pith_short_8","alias_value":"BTP6UC7Q","created_at":"2026-07-04T23:59:34.351720+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/BTP6UC7QR5LY5GKPO3DZUJOLGO","json":"https://pith.science/pith/BTP6UC7QR5LY5GKPO3DZUJOLGO.json","graph_json":"https://pith.science/api/pith-number/BTP6UC7QR5LY5GKPO3DZUJOLGO/graph.json","events_json":"https://pith.science/api/pith-number/BTP6UC7QR5LY5GKPO3DZUJOLGO/events.json","paper":"https://pith.science/paper/BTP6UC7Q"},"agent_actions":{"view_html":"https://pith.science/pith/BTP6UC7QR5LY5GKPO3DZUJOLGO","download_json":"https://pith.science/pith/BTP6UC7QR5LY5GKPO3DZUJOLGO.json","view_paper":"https://pith.science/paper/BTP6UC7Q","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1908.02021&json=true","fetch_graph":"https://pith.science/api/pith-number/BTP6UC7QR5LY5GKPO3DZUJOLGO/graph.json","fetch_events":"https://pith.science/api/pith-number/BTP6UC7QR5LY5GKPO3DZUJOLGO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BTP6UC7QR5LY5GKPO3DZUJOLGO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BTP6UC7QR5LY5GKPO3DZUJOLGO/action/storage_attestation","attest_author":"https://pith.science/pith/BTP6UC7QR5LY5GKPO3DZUJOLGO/action/author_attestation","sign_citation":"https://pith.science/pith/BTP6UC7QR5LY5GKPO3DZUJOLGO/action/citation_signature","submit_replication":"https://pith.science/pith/BTP6UC7QR5LY5GKPO3DZUJOLGO/action/replication_record"}},"created_at":"2026-07-04T23:59:34.351720+00:00","updated_at":"2026-07-04T23:59:34.351720+00:00"}