{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:BTT6YUKHCA4KHYGQLLMASIORAR","short_pith_number":"pith:BTT6YUKH","canonical_record":{"source":{"id":"1608.03667","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2016-08-12T03:42:28Z","cross_cats_sorted":[],"title_canon_sha256":"4293ddf2413e178fdb4ab3b0a047e185f8ec146b4d8b3eaff0afc3433aa9af4b","abstract_canon_sha256":"cedea26e7e61612a28d98c9234c7ee81fe15a2f357bf3e7472da4ba82fbe88d0"},"schema_version":"1.0"},"canonical_sha256":"0ce7ec51471038a3e0d05ad80921d10440a8d3b3a54638bd5fd668fb0b72c5b5","source":{"kind":"arxiv","id":"1608.03667","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.03667","created_at":"2026-05-18T01:09:12Z"},{"alias_kind":"arxiv_version","alias_value":"1608.03667v1","created_at":"2026-05-18T01:09:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.03667","created_at":"2026-05-18T01:09:12Z"},{"alias_kind":"pith_short_12","alias_value":"BTT6YUKHCA4K","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_16","alias_value":"BTT6YUKHCA4KHYGQ","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_8","alias_value":"BTT6YUKH","created_at":"2026-05-18T12:30:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:BTT6YUKHCA4KHYGQLLMASIORAR","target":"record","payload":{"canonical_record":{"source":{"id":"1608.03667","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2016-08-12T03:42:28Z","cross_cats_sorted":[],"title_canon_sha256":"4293ddf2413e178fdb4ab3b0a047e185f8ec146b4d8b3eaff0afc3433aa9af4b","abstract_canon_sha256":"cedea26e7e61612a28d98c9234c7ee81fe15a2f357bf3e7472da4ba82fbe88d0"},"schema_version":"1.0"},"canonical_sha256":"0ce7ec51471038a3e0d05ad80921d10440a8d3b3a54638bd5fd668fb0b72c5b5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:09:12.162888Z","signature_b64":"4EWUlg2jGrmx1F8HOw43DgY9Rts7KSVgil/ALCxReOQiDlcCBJvi6FW5IGSXFZmcuXsSJdxASCYBDbheeqOMAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0ce7ec51471038a3e0d05ad80921d10440a8d3b3a54638bd5fd668fb0b72c5b5","last_reissued_at":"2026-05-18T01:09:12.162473Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:09:12.162473Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1608.03667","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-18T01:09:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AYyd/nrgshxT0vHk+wV+lDyTGGzXD3iGEiK5Yhk1SVMl6GIXvoktZzqjdt2TvoIE0Iy8nLChazotrEoROjGSDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T07:05:03.879780Z"},"content_sha256":"97313411bf5eac6263fc68baf5457cbcc67b93482377f3d8e500e75a55f4fcbe","schema_version":"1.0","event_id":"sha256:97313411bf5eac6263fc68baf5457cbcc67b93482377f3d8e500e75a55f4fcbe"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:BTT6YUKHCA4KHYGQLLMASIORAR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Reasoning and Algorithm Selection Augmented Symbolic Segmentation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Kamila Abdiyeva, Martin Lukac, Michitaka Kameyama","submitted_at":"2016-08-12T03:42:28Z","abstract_excerpt":"In this paper we present an alternative method to symbolic segmentation: we approach symbolic segmentation as an algorithm selection problem. That is, let there be a set A of available algorithms for symbolic segmentation, a set of input features $F$, a set of image attribute $\\mathbb{A}$ and a selection mechanism $S(F,\\mathbb{A},A)$ that selects on a case by case basis the best algorithm. The semantic segmentation is then an optimization process that combines best component segments from multiple results into a single optimal result. The experiments compare three different algorithm selection"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.03667","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-18T01:09:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xo4vNBDcg/3bqR0yeS7sTj86SrH1xUj7t5j5eD91VB0Vecgh+uIkIcrcUk0df39OhYapTOhORkptZ4xO1VR7BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T07:05:03.880127Z"},"content_sha256":"fe069a8d7e5423190c5d21ada7e0ebbdc1998ad70a80303be9f275ea23f99860","schema_version":"1.0","event_id":"sha256:fe069a8d7e5423190c5d21ada7e0ebbdc1998ad70a80303be9f275ea23f99860"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BTT6YUKHCA4KHYGQLLMASIORAR/bundle.json","state_url":"https://pith.science/pith/BTT6YUKHCA4KHYGQLLMASIORAR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BTT6YUKHCA4KHYGQLLMASIORAR/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-03T07:05:03Z","links":{"resolver":"https://pith.science/pith/BTT6YUKHCA4KHYGQLLMASIORAR","bundle":"https://pith.science/pith/BTT6YUKHCA4KHYGQLLMASIORAR/bundle.json","state":"https://pith.science/pith/BTT6YUKHCA4KHYGQLLMASIORAR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BTT6YUKHCA4KHYGQLLMASIORAR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:BTT6YUKHCA4KHYGQLLMASIORAR","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":"cedea26e7e61612a28d98c9234c7ee81fe15a2f357bf3e7472da4ba82fbe88d0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2016-08-12T03:42:28Z","title_canon_sha256":"4293ddf2413e178fdb4ab3b0a047e185f8ec146b4d8b3eaff0afc3433aa9af4b"},"schema_version":"1.0","source":{"id":"1608.03667","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.03667","created_at":"2026-05-18T01:09:12Z"},{"alias_kind":"arxiv_version","alias_value":"1608.03667v1","created_at":"2026-05-18T01:09:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.03667","created_at":"2026-05-18T01:09:12Z"},{"alias_kind":"pith_short_12","alias_value":"BTT6YUKHCA4K","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_16","alias_value":"BTT6YUKHCA4KHYGQ","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_8","alias_value":"BTT6YUKH","created_at":"2026-05-18T12:30:09Z"}],"graph_snapshots":[{"event_id":"sha256:fe069a8d7e5423190c5d21ada7e0ebbdc1998ad70a80303be9f275ea23f99860","target":"graph","created_at":"2026-05-18T01:09:12Z","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":"In this paper we present an alternative method to symbolic segmentation: we approach symbolic segmentation as an algorithm selection problem. That is, let there be a set A of available algorithms for symbolic segmentation, a set of input features $F$, a set of image attribute $\\mathbb{A}$ and a selection mechanism $S(F,\\mathbb{A},A)$ that selects on a case by case basis the best algorithm. The semantic segmentation is then an optimization process that combines best component segments from multiple results into a single optimal result. The experiments compare three different algorithm selection","authors_text":"Kamila Abdiyeva, Martin Lukac, Michitaka Kameyama","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2016-08-12T03:42:28Z","title":"Reasoning and Algorithm Selection Augmented Symbolic Segmentation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.03667","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:97313411bf5eac6263fc68baf5457cbcc67b93482377f3d8e500e75a55f4fcbe","target":"record","created_at":"2026-05-18T01:09:12Z","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":"cedea26e7e61612a28d98c9234c7ee81fe15a2f357bf3e7472da4ba82fbe88d0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2016-08-12T03:42:28Z","title_canon_sha256":"4293ddf2413e178fdb4ab3b0a047e185f8ec146b4d8b3eaff0afc3433aa9af4b"},"schema_version":"1.0","source":{"id":"1608.03667","kind":"arxiv","version":1}},"canonical_sha256":"0ce7ec51471038a3e0d05ad80921d10440a8d3b3a54638bd5fd668fb0b72c5b5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0ce7ec51471038a3e0d05ad80921d10440a8d3b3a54638bd5fd668fb0b72c5b5","first_computed_at":"2026-05-18T01:09:12.162473Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:09:12.162473Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4EWUlg2jGrmx1F8HOw43DgY9Rts7KSVgil/ALCxReOQiDlcCBJvi6FW5IGSXFZmcuXsSJdxASCYBDbheeqOMAw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:09:12.162888Z","signed_message":"canonical_sha256_bytes"},"source_id":"1608.03667","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:97313411bf5eac6263fc68baf5457cbcc67b93482377f3d8e500e75a55f4fcbe","sha256:fe069a8d7e5423190c5d21ada7e0ebbdc1998ad70a80303be9f275ea23f99860"],"state_sha256":"998467aba2902337e2ff33266099a3556492021a3fa9bc5c354295faf4a42b75"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AH0QjfCRtiqakJY7dhpBHa6NrTOMjMhenZ246+f9GzeG7eOIaL4+A1OpTrTI7eBM45GU3BqZkM3epf9OmjKzBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T07:05:03.882005Z","bundle_sha256":"1f0faba7e28738fc422cf500679333c53ddb61175b8c9d4d0f04154f85ef59e6"}}