{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:YDOKJLYAFZAGQY6EWBCNYTT5IH","short_pith_number":"pith:YDOKJLYA","canonical_record":{"source":{"id":"1807.09210","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-07-24T16:16:41Z","cross_cats_sorted":[],"title_canon_sha256":"68889c20bb37ab6694f7d756209c0faad01174db30aaa8cbde95e4962989ec9b","abstract_canon_sha256":"8ab5e684f2dd113742c1c8c36f2f9728ba59fe17e391c036437dac14433edfb0"},"schema_version":"1.0"},"canonical_sha256":"c0dca4af002e406863c4b044dc4e7d41c9906694df3bd330f8fd94bf5e7e5b30","source":{"kind":"arxiv","id":"1807.09210","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.09210","created_at":"2026-05-18T00:09:51Z"},{"alias_kind":"arxiv_version","alias_value":"1807.09210v1","created_at":"2026-05-18T00:09:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.09210","created_at":"2026-05-18T00:09:51Z"},{"alias_kind":"pith_short_12","alias_value":"YDOKJLYAFZAG","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_16","alias_value":"YDOKJLYAFZAGQY6E","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_8","alias_value":"YDOKJLYA","created_at":"2026-05-18T12:33:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:YDOKJLYAFZAGQY6EWBCNYTT5IH","target":"record","payload":{"canonical_record":{"source":{"id":"1807.09210","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-07-24T16:16:41Z","cross_cats_sorted":[],"title_canon_sha256":"68889c20bb37ab6694f7d756209c0faad01174db30aaa8cbde95e4962989ec9b","abstract_canon_sha256":"8ab5e684f2dd113742c1c8c36f2f9728ba59fe17e391c036437dac14433edfb0"},"schema_version":"1.0"},"canonical_sha256":"c0dca4af002e406863c4b044dc4e7d41c9906694df3bd330f8fd94bf5e7e5b30","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:09:51.827842Z","signature_b64":"KHc30FoyUHr1ZrDj0gERhezD0mOTwZsfk070m+EZrkw1AJOCYxqTMvz9j/bzrXAA9csMMhg8iHh/sbz24F3iCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c0dca4af002e406863c4b044dc4e7d41c9906694df3bd330f8fd94bf5e7e5b30","last_reissued_at":"2026-05-18T00:09:51.826386Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:09:51.826386Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1807.09210","source_version":1,"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:09:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iyUK/QI1S7+MVbqgv/ZsoQ9fQe1qciecxXd7ydG3wDwtS969co7Z3Lt0aS46r4HW9pSvr2UD5N/xk76sQqncCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T21:15:28.419496Z"},"content_sha256":"f4016839cd58444de2b2634973074e8fc71084072531cb56b843885004d59e5d","schema_version":"1.0","event_id":"sha256:f4016839cd58444de2b2634973074e8fc71084072531cb56b843885004d59e5d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:YDOKJLYAFZAGQY6EWBCNYTT5IH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Deterministic Fitting of Multiple Structures using Iterative MaxFS with Inlier Scale Estimation and Subset Updating","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Kwang Hee Lee, Sang Wook Lee","submitted_at":"2018-07-24T16:16:41Z","abstract_excerpt":"We present an efficient deterministic hypothesis generation algorithm for robust fitting of multiple structures based on the maximum feasible subsystem (MaxFS) framework. Despite its advantage, a global optimization method such as MaxFS has two main limitations for geometric model fitting. First, its performance is much influenced by the user-specified inlier scale. Second, it is computationally inefficient for large data. The presented MaxFS-based algorithm iteratively estimates model parameters and inlier scale and also overcomes the second limitation by reducing data for the MaxFS problem. "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.09210","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"},"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:09:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JhtlhtKuA3pJtsLJqPocL/MfDIeBgV8WiJm+wbkZPyxyI4Wqce2rBa8yF4+GNQeonMa4dFpvLamCAlFmT5SSAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T21:15:28.419829Z"},"content_sha256":"80a2f1e2c76c3ab45fd82093795f072af458785274b87db2af202161b46f759e","schema_version":"1.0","event_id":"sha256:80a2f1e2c76c3ab45fd82093795f072af458785274b87db2af202161b46f759e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YDOKJLYAFZAGQY6EWBCNYTT5IH/bundle.json","state_url":"https://pith.science/pith/YDOKJLYAFZAGQY6EWBCNYTT5IH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YDOKJLYAFZAGQY6EWBCNYTT5IH/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-26T21:15:28Z","links":{"resolver":"https://pith.science/pith/YDOKJLYAFZAGQY6EWBCNYTT5IH","bundle":"https://pith.science/pith/YDOKJLYAFZAGQY6EWBCNYTT5IH/bundle.json","state":"https://pith.science/pith/YDOKJLYAFZAGQY6EWBCNYTT5IH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YDOKJLYAFZAGQY6EWBCNYTT5IH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:YDOKJLYAFZAGQY6EWBCNYTT5IH","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":"8ab5e684f2dd113742c1c8c36f2f9728ba59fe17e391c036437dac14433edfb0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-07-24T16:16:41Z","title_canon_sha256":"68889c20bb37ab6694f7d756209c0faad01174db30aaa8cbde95e4962989ec9b"},"schema_version":"1.0","source":{"id":"1807.09210","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.09210","created_at":"2026-05-18T00:09:51Z"},{"alias_kind":"arxiv_version","alias_value":"1807.09210v1","created_at":"2026-05-18T00:09:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.09210","created_at":"2026-05-18T00:09:51Z"},{"alias_kind":"pith_short_12","alias_value":"YDOKJLYAFZAG","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_16","alias_value":"YDOKJLYAFZAGQY6E","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_8","alias_value":"YDOKJLYA","created_at":"2026-05-18T12:33:04Z"}],"graph_snapshots":[{"event_id":"sha256:80a2f1e2c76c3ab45fd82093795f072af458785274b87db2af202161b46f759e","target":"graph","created_at":"2026-05-18T00:09:51Z","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":"We present an efficient deterministic hypothesis generation algorithm for robust fitting of multiple structures based on the maximum feasible subsystem (MaxFS) framework. Despite its advantage, a global optimization method such as MaxFS has two main limitations for geometric model fitting. First, its performance is much influenced by the user-specified inlier scale. Second, it is computationally inefficient for large data. The presented MaxFS-based algorithm iteratively estimates model parameters and inlier scale and also overcomes the second limitation by reducing data for the MaxFS problem. ","authors_text":"Kwang Hee Lee, Sang Wook Lee","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-07-24T16:16:41Z","title":"Deterministic Fitting of Multiple Structures using Iterative MaxFS with Inlier Scale Estimation and Subset Updating"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.09210","kind":"arxiv","version":1},"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:f4016839cd58444de2b2634973074e8fc71084072531cb56b843885004d59e5d","target":"record","created_at":"2026-05-18T00:09:51Z","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":"8ab5e684f2dd113742c1c8c36f2f9728ba59fe17e391c036437dac14433edfb0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-07-24T16:16:41Z","title_canon_sha256":"68889c20bb37ab6694f7d756209c0faad01174db30aaa8cbde95e4962989ec9b"},"schema_version":"1.0","source":{"id":"1807.09210","kind":"arxiv","version":1}},"canonical_sha256":"c0dca4af002e406863c4b044dc4e7d41c9906694df3bd330f8fd94bf5e7e5b30","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c0dca4af002e406863c4b044dc4e7d41c9906694df3bd330f8fd94bf5e7e5b30","first_computed_at":"2026-05-18T00:09:51.826386Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:09:51.826386Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KHc30FoyUHr1ZrDj0gERhezD0mOTwZsfk070m+EZrkw1AJOCYxqTMvz9j/bzrXAA9csMMhg8iHh/sbz24F3iCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:09:51.827842Z","signed_message":"canonical_sha256_bytes"},"source_id":"1807.09210","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f4016839cd58444de2b2634973074e8fc71084072531cb56b843885004d59e5d","sha256:80a2f1e2c76c3ab45fd82093795f072af458785274b87db2af202161b46f759e"],"state_sha256":"59488f5bfbb4ebd7ebfb245c6877231dbe92dd8258292722d48e0ac9cc96e0f3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WvdSTMtabNWGCQpTa3+Xj4Fc230ddNcY2t/18M8hladcXYmRs3FsJSE5BICE9WHR9JPomGMZzWZi6vyL/5avAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-26T21:15:28.421644Z","bundle_sha256":"584062ca4c92379de4ceb2d028a656ca8898e1eee20ebbcb5492f67002858ead"}}