{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:FXUH3PKPP44LLVYXOGMR5UDV23","short_pith_number":"pith:FXUH3PKP","schema_version":"1.0","canonical_sha256":"2de87dbd4f7f38b5d71771991ed075d6c96d3dc3a282393868619f622e47e150","source":{"kind":"arxiv","id":"1804.02032","version":1},"attestation_state":"computed","paper":{"title":"A Multi-Layer Approach to Superpixel-based Higher-order Conditional Random Field for Semantic Image Segmentation","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Alexander Aved, Ishfaq Ahmad, Li Sulimowicz","submitted_at":"2018-04-05T19:31:03Z","abstract_excerpt":"Superpixel-based Higher-order Conditional random fields (SP-HO-CRFs) are known for their effectiveness in enforcing both short and long spatial contiguity for pixelwise labelling in computer vision. However, their higher-order potentials are usually too complex to learn and often incur a high computational cost in performing inference. We propose an new approximation approach to SP-HO-CRFs that resolves these problems. Our approach is a multi-layer CRF framework that inherits the simplicity from pairwise CRFs by formulating both the higher-order and pairwise cues into the same pairwise potenti"},"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":"1804.02032","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.CV","submitted_at":"2018-04-05T19:31:03Z","cross_cats_sorted":[],"title_canon_sha256":"a9cb6b9a89264a1a57236d85987e220a0f0c6bdc3136acd4e73b4fd46f0b9fa9","abstract_canon_sha256":"7d7c3276a954e6dfe1bb7a25bac46caf3cedb777dad2be2ae5ef0cdcd7d46806"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:19:08.049088Z","signature_b64":"YVbk3llidVanUXjM3WihjGFHfQETqtGOpoa27d0JWinXyW15YBlbu8l3+XFZQkVL90Y0qWClXNzR2mKIRupwCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2de87dbd4f7f38b5d71771991ed075d6c96d3dc3a282393868619f622e47e150","last_reissued_at":"2026-05-18T00:19:08.048488Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:19:08.048488Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Multi-Layer Approach to Superpixel-based Higher-order Conditional Random Field for Semantic Image Segmentation","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Alexander Aved, Ishfaq Ahmad, Li Sulimowicz","submitted_at":"2018-04-05T19:31:03Z","abstract_excerpt":"Superpixel-based Higher-order Conditional random fields (SP-HO-CRFs) are known for their effectiveness in enforcing both short and long spatial contiguity for pixelwise labelling in computer vision. However, their higher-order potentials are usually too complex to learn and often incur a high computational cost in performing inference. We propose an new approximation approach to SP-HO-CRFs that resolves these problems. Our approach is a multi-layer CRF framework that inherits the simplicity from pairwise CRFs by formulating both the higher-order and pairwise cues into the same pairwise potenti"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.02032","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":"1804.02032","created_at":"2026-05-18T00:19:08.048604+00:00"},{"alias_kind":"arxiv_version","alias_value":"1804.02032v1","created_at":"2026-05-18T00:19:08.048604+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.02032","created_at":"2026-05-18T00:19:08.048604+00:00"},{"alias_kind":"pith_short_12","alias_value":"FXUH3PKPP44L","created_at":"2026-05-18T12:32:25.280505+00:00"},{"alias_kind":"pith_short_16","alias_value":"FXUH3PKPP44LLVYX","created_at":"2026-05-18T12:32:25.280505+00:00"},{"alias_kind":"pith_short_8","alias_value":"FXUH3PKP","created_at":"2026-05-18T12:32:25.280505+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/FXUH3PKPP44LLVYXOGMR5UDV23","json":"https://pith.science/pith/FXUH3PKPP44LLVYXOGMR5UDV23.json","graph_json":"https://pith.science/api/pith-number/FXUH3PKPP44LLVYXOGMR5UDV23/graph.json","events_json":"https://pith.science/api/pith-number/FXUH3PKPP44LLVYXOGMR5UDV23/events.json","paper":"https://pith.science/paper/FXUH3PKP"},"agent_actions":{"view_html":"https://pith.science/pith/FXUH3PKPP44LLVYXOGMR5UDV23","download_json":"https://pith.science/pith/FXUH3PKPP44LLVYXOGMR5UDV23.json","view_paper":"https://pith.science/paper/FXUH3PKP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1804.02032&json=true","fetch_graph":"https://pith.science/api/pith-number/FXUH3PKPP44LLVYXOGMR5UDV23/graph.json","fetch_events":"https://pith.science/api/pith-number/FXUH3PKPP44LLVYXOGMR5UDV23/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FXUH3PKPP44LLVYXOGMR5UDV23/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FXUH3PKPP44LLVYXOGMR5UDV23/action/storage_attestation","attest_author":"https://pith.science/pith/FXUH3PKPP44LLVYXOGMR5UDV23/action/author_attestation","sign_citation":"https://pith.science/pith/FXUH3PKPP44LLVYXOGMR5UDV23/action/citation_signature","submit_replication":"https://pith.science/pith/FXUH3PKPP44LLVYXOGMR5UDV23/action/replication_record"}},"created_at":"2026-05-18T00:19:08.048604+00:00","updated_at":"2026-05-18T00:19:08.048604+00:00"}