{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:SPBQTASTWD7GV4735LULT32AF2","short_pith_number":"pith:SPBQTAST","canonical_record":{"source":{"id":"1902.01534","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-02-05T04:06:26Z","cross_cats_sorted":[],"title_canon_sha256":"b512b8d8d1a1badd4f907ec4228c6877572cccb45e106d2fbdcceef50e8a17bc","abstract_canon_sha256":"95b75eb30d61390b12c1bd6a8928740e3b4288dc0ae75622e2d7581a790d5472"},"schema_version":"1.0"},"canonical_sha256":"93c3098253b0fe6af3fbeae8b9ef402e8c3b8f5c03bcb2449047d7a9d9d69a38","source":{"kind":"arxiv","id":"1902.01534","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.01534","created_at":"2026-07-05T00:44:05Z"},{"alias_kind":"arxiv_version","alias_value":"1902.01534v2","created_at":"2026-07-05T00:44:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.01534","created_at":"2026-07-05T00:44:05Z"},{"alias_kind":"pith_short_12","alias_value":"SPBQTASTWD7G","created_at":"2026-07-05T00:44:05Z"},{"alias_kind":"pith_short_16","alias_value":"SPBQTASTWD7GV473","created_at":"2026-07-05T00:44:05Z"},{"alias_kind":"pith_short_8","alias_value":"SPBQTAST","created_at":"2026-07-05T00:44:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:SPBQTASTWD7GV4735LULT32AF2","target":"record","payload":{"canonical_record":{"source":{"id":"1902.01534","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-02-05T04:06:26Z","cross_cats_sorted":[],"title_canon_sha256":"b512b8d8d1a1badd4f907ec4228c6877572cccb45e106d2fbdcceef50e8a17bc","abstract_canon_sha256":"95b75eb30d61390b12c1bd6a8928740e3b4288dc0ae75622e2d7581a790d5472"},"schema_version":"1.0"},"canonical_sha256":"93c3098253b0fe6af3fbeae8b9ef402e8c3b8f5c03bcb2449047d7a9d9d69a38","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:44:05.944058Z","signature_b64":"SrZqsCblLIexRoiG4dmTq7K8cvNrWVF2gCdvd5PqLp41LbAey3p7rHRbY0JP3tngUjgukZmhhHesQDaW9uB2Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"93c3098253b0fe6af3fbeae8b9ef402e8c3b8f5c03bcb2449047d7a9d9d69a38","last_reissued_at":"2026-07-05T00:44:05.943643Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:44:05.943643Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1902.01534","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-07-05T00:44:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FSIPUyZw9GYjSUByuFmTQOAc3LeY0KvZC5IEWSYQI1k5TpACF0h0wRPHN/qRK6ax5+4wHapvjcU0bO1gqa8DDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-19T04:59:30.941981Z"},"content_sha256":"95957107d8fbfde985178a2279a55f129a80268c5845145153b13e9106f3efd9","schema_version":"1.0","event_id":"sha256:95957107d8fbfde985178a2279a55f129a80268c5845145153b13e9106f3efd9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:SPBQTASTWD7GV4735LULT32AF2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Practical Maximum Clique Algorithm for Matching with Pairwise Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"\\'Alvaro Parra, Frank Neumann, Maximilian Katzmann, Tat-Jun Chin, Tobias Friedrich","submitted_at":"2019-02-05T04:06:26Z","abstract_excerpt":"A popular paradigm for 3D point cloud registration is by extracting 3D keypoint correspondences, then estimating the registration function from the correspondences using a robust algorithm. However, many existing 3D keypoint techniques tend to produce large proportions of erroneous correspondences or outliers, which significantly increases the cost of robust estimation. An alternative approach is to directly search for the subset of correspondences that are pairwise consistent, without optimising the registration function. This gives rise to the combinatorial problem of matching with pairwise "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.01534","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1902.01534/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"},"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-07-05T00:44:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ezWePKgCNC+d8YT5zjkeZLNR0S0vhyz7rPbmb2lJXhSY1kNvIS7tE25dPt4CS7TqwzDTiZoWTXk2sy0pCMlxCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-19T04:59:30.942481Z"},"content_sha256":"5ded7a1b0e4c9fab304d06ad077257b025f3391c098841f5d2ae0d6be3363999","schema_version":"1.0","event_id":"sha256:5ded7a1b0e4c9fab304d06ad077257b025f3391c098841f5d2ae0d6be3363999"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SPBQTASTWD7GV4735LULT32AF2/bundle.json","state_url":"https://pith.science/pith/SPBQTASTWD7GV4735LULT32AF2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SPBQTASTWD7GV4735LULT32AF2/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-08-19T04:59:30Z","links":{"resolver":"https://pith.science/pith/SPBQTASTWD7GV4735LULT32AF2","bundle":"https://pith.science/pith/SPBQTASTWD7GV4735LULT32AF2/bundle.json","state":"https://pith.science/pith/SPBQTASTWD7GV4735LULT32AF2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SPBQTASTWD7GV4735LULT32AF2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:SPBQTASTWD7GV4735LULT32AF2","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":"95b75eb30d61390b12c1bd6a8928740e3b4288dc0ae75622e2d7581a790d5472","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-02-05T04:06:26Z","title_canon_sha256":"b512b8d8d1a1badd4f907ec4228c6877572cccb45e106d2fbdcceef50e8a17bc"},"schema_version":"1.0","source":{"id":"1902.01534","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.01534","created_at":"2026-07-05T00:44:05Z"},{"alias_kind":"arxiv_version","alias_value":"1902.01534v2","created_at":"2026-07-05T00:44:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.01534","created_at":"2026-07-05T00:44:05Z"},{"alias_kind":"pith_short_12","alias_value":"SPBQTASTWD7G","created_at":"2026-07-05T00:44:05Z"},{"alias_kind":"pith_short_16","alias_value":"SPBQTASTWD7GV473","created_at":"2026-07-05T00:44:05Z"},{"alias_kind":"pith_short_8","alias_value":"SPBQTAST","created_at":"2026-07-05T00:44:05Z"}],"graph_snapshots":[{"event_id":"sha256:5ded7a1b0e4c9fab304d06ad077257b025f3391c098841f5d2ae0d6be3363999","target":"graph","created_at":"2026-07-05T00:44:05Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1902.01534/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"A popular paradigm for 3D point cloud registration is by extracting 3D keypoint correspondences, then estimating the registration function from the correspondences using a robust algorithm. However, many existing 3D keypoint techniques tend to produce large proportions of erroneous correspondences or outliers, which significantly increases the cost of robust estimation. An alternative approach is to directly search for the subset of correspondences that are pairwise consistent, without optimising the registration function. This gives rise to the combinatorial problem of matching with pairwise ","authors_text":"\\'Alvaro Parra, Frank Neumann, Maximilian Katzmann, Tat-Jun Chin, Tobias Friedrich","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-02-05T04:06:26Z","title":"A Practical Maximum Clique Algorithm for Matching with Pairwise Constraints"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.01534","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:95957107d8fbfde985178a2279a55f129a80268c5845145153b13e9106f3efd9","target":"record","created_at":"2026-07-05T00:44:05Z","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":"95b75eb30d61390b12c1bd6a8928740e3b4288dc0ae75622e2d7581a790d5472","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-02-05T04:06:26Z","title_canon_sha256":"b512b8d8d1a1badd4f907ec4228c6877572cccb45e106d2fbdcceef50e8a17bc"},"schema_version":"1.0","source":{"id":"1902.01534","kind":"arxiv","version":2}},"canonical_sha256":"93c3098253b0fe6af3fbeae8b9ef402e8c3b8f5c03bcb2449047d7a9d9d69a38","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"93c3098253b0fe6af3fbeae8b9ef402e8c3b8f5c03bcb2449047d7a9d9d69a38","first_computed_at":"2026-07-05T00:44:05.943643Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:44:05.943643Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"SrZqsCblLIexRoiG4dmTq7K8cvNrWVF2gCdvd5PqLp41LbAey3p7rHRbY0JP3tngUjgukZmhhHesQDaW9uB2Ag==","signature_status":"signed_v1","signed_at":"2026-07-05T00:44:05.944058Z","signed_message":"canonical_sha256_bytes"},"source_id":"1902.01534","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:95957107d8fbfde985178a2279a55f129a80268c5845145153b13e9106f3efd9","sha256:5ded7a1b0e4c9fab304d06ad077257b025f3391c098841f5d2ae0d6be3363999"],"state_sha256":"c65ec2e8c37c99e01b61598e082b34319cb35fad6caa3179e407fda30bc328c6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PN7Bc/90IieFp78rDIW5tg/4tUIc0yFpQvyeeH/3zQ8whgWjExB0Uhx+N7NPYIGCGWqvHvsm3yJ8Xx5tkbS5BA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-19T04:59:30.948395Z","bundle_sha256":"9f242062951a6cd254d6c8c427fb0f221fc50cfb0d70c17725093191dcf7bd7a"}}