{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:5XT425QFEOOZXXB3J3MVA3ZMDP","short_pith_number":"pith:5XT425QF","canonical_record":{"source":{"id":"1807.01963","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-07-05T12:34:40Z","cross_cats_sorted":[],"title_canon_sha256":"a1ac74b06881a769eaff7ccc2b7fc3197f3221910839e18135bdd68dbe4fbc5a","abstract_canon_sha256":"38a250ccb7e4da00752ba0ee19f6699cfc7e68a5f46435d8d7b258a691451942"},"schema_version":"1.0"},"canonical_sha256":"ede7cd7605239d9bdc3b4ed9506f2c1be97c9cc5ef9da9f8f83a661d4bed4994","source":{"kind":"arxiv","id":"1807.01963","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.01963","created_at":"2026-05-18T00:08:20Z"},{"alias_kind":"arxiv_version","alias_value":"1807.01963v2","created_at":"2026-05-18T00:08:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.01963","created_at":"2026-05-18T00:08:20Z"},{"alias_kind":"pith_short_12","alias_value":"5XT425QFEOOZ","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_16","alias_value":"5XT425QFEOOZXXB3","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_8","alias_value":"5XT425QF","created_at":"2026-05-18T12:32:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:5XT425QFEOOZXXB3J3MVA3ZMDP","target":"record","payload":{"canonical_record":{"source":{"id":"1807.01963","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-07-05T12:34:40Z","cross_cats_sorted":[],"title_canon_sha256":"a1ac74b06881a769eaff7ccc2b7fc3197f3221910839e18135bdd68dbe4fbc5a","abstract_canon_sha256":"38a250ccb7e4da00752ba0ee19f6699cfc7e68a5f46435d8d7b258a691451942"},"schema_version":"1.0"},"canonical_sha256":"ede7cd7605239d9bdc3b4ed9506f2c1be97c9cc5ef9da9f8f83a661d4bed4994","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:08:20.472241Z","signature_b64":"6DGEAubAv/DyR88bXQHOgV/Wr6mSjeQxPc/+cEk/NK4hPcrCqSenJxAs4WHin+tMIn0RcHmorVUCxm0OQUGXCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ede7cd7605239d9bdc3b4ed9506f2c1be97c9cc5ef9da9f8f83a661d4bed4994","last_reissued_at":"2026-05-18T00:08:20.471516Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:08:20.471516Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1807.01963","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-18T00:08:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jzi2zB6mF1eljWSaZAxVEfQ2q0s+ccd65es1x+9dvEEHZb8eYuzwlPiCV+ioZ0tndAm5jBi43/J8/w389iPMAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T15:52:27.214270Z"},"content_sha256":"f37c959efa5bdd6c50a87d4c19351e43cf9c114bdfede7496d27c79e306dece6","schema_version":"1.0","event_id":"sha256:f37c959efa5bdd6c50a87d4c19351e43cf9c114bdfede7496d27c79e306dece6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:5XT425QFEOOZXXB3J3MVA3ZMDP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Model-free Consensus Maximization for Non-Rigid Shapes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Ajad Chhatkuli, Danda Pani Paudel, Luc Van Gool, Thomas Probst","submitted_at":"2018-07-05T12:34:40Z","abstract_excerpt":"Many computer vision methods use consensus maximization to relate measurements containing outliers with the correct transformation model. In the context of rigid shapes, this is typically done using Random Sampling and Consensus (RANSAC) by estimating an analytical model that agrees with the largest number of measurements (inliers). However, small parameter models may not be always available. In this paper, we formulate the model-free consensus maximization as an Integer Program in a graph using `rules' on measurements. We then provide a method to solve it optimally using the Branch and Bound "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.01963","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-18T00:08:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"c9Rqe9Tu3falbsiDc0vxMIjEfqFqVZmSO5F9VwBG4C91EYbyT74DtMujb+Mmkp9dP+o/jkk1nv0ZrbiaQEiUCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T15:52:27.214921Z"},"content_sha256":"122adc2d553bf644d9be71515673a800f35cf10996a213edf15a585c7d26fb82","schema_version":"1.0","event_id":"sha256:122adc2d553bf644d9be71515673a800f35cf10996a213edf15a585c7d26fb82"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5XT425QFEOOZXXB3J3MVA3ZMDP/bundle.json","state_url":"https://pith.science/pith/5XT425QFEOOZXXB3J3MVA3ZMDP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5XT425QFEOOZXXB3J3MVA3ZMDP/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-02T15:52:27Z","links":{"resolver":"https://pith.science/pith/5XT425QFEOOZXXB3J3MVA3ZMDP","bundle":"https://pith.science/pith/5XT425QFEOOZXXB3J3MVA3ZMDP/bundle.json","state":"https://pith.science/pith/5XT425QFEOOZXXB3J3MVA3ZMDP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5XT425QFEOOZXXB3J3MVA3ZMDP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:5XT425QFEOOZXXB3J3MVA3ZMDP","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":"38a250ccb7e4da00752ba0ee19f6699cfc7e68a5f46435d8d7b258a691451942","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-07-05T12:34:40Z","title_canon_sha256":"a1ac74b06881a769eaff7ccc2b7fc3197f3221910839e18135bdd68dbe4fbc5a"},"schema_version":"1.0","source":{"id":"1807.01963","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.01963","created_at":"2026-05-18T00:08:20Z"},{"alias_kind":"arxiv_version","alias_value":"1807.01963v2","created_at":"2026-05-18T00:08:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.01963","created_at":"2026-05-18T00:08:20Z"},{"alias_kind":"pith_short_12","alias_value":"5XT425QFEOOZ","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_16","alias_value":"5XT425QFEOOZXXB3","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_8","alias_value":"5XT425QF","created_at":"2026-05-18T12:32:08Z"}],"graph_snapshots":[{"event_id":"sha256:122adc2d553bf644d9be71515673a800f35cf10996a213edf15a585c7d26fb82","target":"graph","created_at":"2026-05-18T00:08:20Z","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":"Many computer vision methods use consensus maximization to relate measurements containing outliers with the correct transformation model. In the context of rigid shapes, this is typically done using Random Sampling and Consensus (RANSAC) by estimating an analytical model that agrees with the largest number of measurements (inliers). However, small parameter models may not be always available. In this paper, we formulate the model-free consensus maximization as an Integer Program in a graph using `rules' on measurements. We then provide a method to solve it optimally using the Branch and Bound ","authors_text":"Ajad Chhatkuli, Danda Pani Paudel, Luc Van Gool, Thomas Probst","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-07-05T12:34:40Z","title":"Model-free Consensus Maximization for Non-Rigid Shapes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.01963","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:f37c959efa5bdd6c50a87d4c19351e43cf9c114bdfede7496d27c79e306dece6","target":"record","created_at":"2026-05-18T00:08:20Z","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":"38a250ccb7e4da00752ba0ee19f6699cfc7e68a5f46435d8d7b258a691451942","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-07-05T12:34:40Z","title_canon_sha256":"a1ac74b06881a769eaff7ccc2b7fc3197f3221910839e18135bdd68dbe4fbc5a"},"schema_version":"1.0","source":{"id":"1807.01963","kind":"arxiv","version":2}},"canonical_sha256":"ede7cd7605239d9bdc3b4ed9506f2c1be97c9cc5ef9da9f8f83a661d4bed4994","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ede7cd7605239d9bdc3b4ed9506f2c1be97c9cc5ef9da9f8f83a661d4bed4994","first_computed_at":"2026-05-18T00:08:20.471516Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:08:20.471516Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6DGEAubAv/DyR88bXQHOgV/Wr6mSjeQxPc/+cEk/NK4hPcrCqSenJxAs4WHin+tMIn0RcHmorVUCxm0OQUGXCw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:08:20.472241Z","signed_message":"canonical_sha256_bytes"},"source_id":"1807.01963","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f37c959efa5bdd6c50a87d4c19351e43cf9c114bdfede7496d27c79e306dece6","sha256:122adc2d553bf644d9be71515673a800f35cf10996a213edf15a585c7d26fb82"],"state_sha256":"dc9bc269bfca12e2003c63cf364970256ade8f4a06a60e75389ba6bad9831136"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZqKzAERzviSFPLRV7uDsF79tPzuHr7SptlBKKcaQ0DGF6MnhqAE2gurlXeaRrSPCNjTVUSbgji3JYTGMMNXyAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T15:52:27.218727Z","bundle_sha256":"5703a2167e9c3dc99045590af543343c5224330819cda47e40ffe5fa7e3a1f43"}}