{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:BTT6YUKHCA4KHYGQLLMASIORAR","short_pith_number":"pith:BTT6YUKH","schema_version":"1.0","canonical_sha256":"0ce7ec51471038a3e0d05ad80921d10440a8d3b3a54638bd5fd668fb0b72c5b5","source":{"kind":"arxiv","id":"1608.03667","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1608.03667","created_at":"2026-05-18T01:09:12.162526+00:00"},{"alias_kind":"arxiv_version","alias_value":"1608.03667v1","created_at":"2026-05-18T01:09:12.162526+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.03667","created_at":"2026-05-18T01:09:12.162526+00:00"},{"alias_kind":"pith_short_12","alias_value":"BTT6YUKHCA4K","created_at":"2026-05-18T12:30:09.641336+00:00"},{"alias_kind":"pith_short_16","alias_value":"BTT6YUKHCA4KHYGQ","created_at":"2026-05-18T12:30:09.641336+00:00"},{"alias_kind":"pith_short_8","alias_value":"BTT6YUKH","created_at":"2026-05-18T12:30:09.641336+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/BTT6YUKHCA4KHYGQLLMASIORAR","json":"https://pith.science/pith/BTT6YUKHCA4KHYGQLLMASIORAR.json","graph_json":"https://pith.science/api/pith-number/BTT6YUKHCA4KHYGQLLMASIORAR/graph.json","events_json":"https://pith.science/api/pith-number/BTT6YUKHCA4KHYGQLLMASIORAR/events.json","paper":"https://pith.science/paper/BTT6YUKH"},"agent_actions":{"view_html":"https://pith.science/pith/BTT6YUKHCA4KHYGQLLMASIORAR","download_json":"https://pith.science/pith/BTT6YUKHCA4KHYGQLLMASIORAR.json","view_paper":"https://pith.science/paper/BTT6YUKH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1608.03667&json=true","fetch_graph":"https://pith.science/api/pith-number/BTT6YUKHCA4KHYGQLLMASIORAR/graph.json","fetch_events":"https://pith.science/api/pith-number/BTT6YUKHCA4KHYGQLLMASIORAR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BTT6YUKHCA4KHYGQLLMASIORAR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BTT6YUKHCA4KHYGQLLMASIORAR/action/storage_attestation","attest_author":"https://pith.science/pith/BTT6YUKHCA4KHYGQLLMASIORAR/action/author_attestation","sign_citation":"https://pith.science/pith/BTT6YUKHCA4KHYGQLLMASIORAR/action/citation_signature","submit_replication":"https://pith.science/pith/BTT6YUKHCA4KHYGQLLMASIORAR/action/replication_record"}},"created_at":"2026-05-18T01:09:12.162526+00:00","updated_at":"2026-05-18T01:09:12.162526+00:00"}