{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:FXUH3PKPP44LLVYXOGMR5UDV23","short_pith_number":"pith:FXUH3PKP","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"},"canonical_sha256":"2de87dbd4f7f38b5d71771991ed075d6c96d3dc3a282393868619f622e47e150","source":{"kind":"arxiv","id":"1804.02032","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.02032","created_at":"2026-05-18T00:19:08Z"},{"alias_kind":"arxiv_version","alias_value":"1804.02032v1","created_at":"2026-05-18T00:19:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.02032","created_at":"2026-05-18T00:19:08Z"},{"alias_kind":"pith_short_12","alias_value":"FXUH3PKPP44L","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_16","alias_value":"FXUH3PKPP44LLVYX","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_8","alias_value":"FXUH3PKP","created_at":"2026-05-18T12:32:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:FXUH3PKPP44LLVYXOGMR5UDV23","target":"record","payload":{"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"},"canonical_sha256":"2de87dbd4f7f38b5d71771991ed075d6c96d3dc3a282393868619f622e47e150","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"},"source_kind":"arxiv","source_id":"1804.02032","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:19:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4REuTEbnAjL9SsbECwjch0Yn3l1hxusRVS+5LnM4TqSMkfXkh0dAd0JHY4rpiA/LVXD8Imp+3TNf5Riyz0TpBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T01:53:41.359653Z"},"content_sha256":"356585708008615cb445be24236ced6182c500f65d5a6ab1e2ee73f89dc21d42","schema_version":"1.0","event_id":"sha256:356585708008615cb445be24236ced6182c500f65d5a6ab1e2ee73f89dc21d42"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:FXUH3PKPP44LLVYXOGMR5UDV23","target":"graph","payload":{"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"},"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:19:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"x0nYtBeOr04UbGNKdWBo2zrtofUzyXOd4QaNH7SANrLnQhFEsf7pbS1uKm9Gb+LLAbEaGOOwUpVCLeqXS69gCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T01:53:41.360005Z"},"content_sha256":"6f301aef72bac577873db8d12516739c864371ceaefb8583278365d8b5cfc118","schema_version":"1.0","event_id":"sha256:6f301aef72bac577873db8d12516739c864371ceaefb8583278365d8b5cfc118"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FXUH3PKPP44LLVYXOGMR5UDV23/bundle.json","state_url":"https://pith.science/pith/FXUH3PKPP44LLVYXOGMR5UDV23/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FXUH3PKPP44LLVYXOGMR5UDV23/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-05T01:53:41Z","links":{"resolver":"https://pith.science/pith/FXUH3PKPP44LLVYXOGMR5UDV23","bundle":"https://pith.science/pith/FXUH3PKPP44LLVYXOGMR5UDV23/bundle.json","state":"https://pith.science/pith/FXUH3PKPP44LLVYXOGMR5UDV23/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FXUH3PKPP44LLVYXOGMR5UDV23/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:FXUH3PKPP44LLVYXOGMR5UDV23","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":"7d7c3276a954e6dfe1bb7a25bac46caf3cedb777dad2be2ae5ef0cdcd7d46806","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.CV","submitted_at":"2018-04-05T19:31:03Z","title_canon_sha256":"a9cb6b9a89264a1a57236d85987e220a0f0c6bdc3136acd4e73b4fd46f0b9fa9"},"schema_version":"1.0","source":{"id":"1804.02032","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.02032","created_at":"2026-05-18T00:19:08Z"},{"alias_kind":"arxiv_version","alias_value":"1804.02032v1","created_at":"2026-05-18T00:19:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.02032","created_at":"2026-05-18T00:19:08Z"},{"alias_kind":"pith_short_12","alias_value":"FXUH3PKPP44L","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_16","alias_value":"FXUH3PKPP44LLVYX","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_8","alias_value":"FXUH3PKP","created_at":"2026-05-18T12:32:25Z"}],"graph_snapshots":[{"event_id":"sha256:6f301aef72bac577873db8d12516739c864371ceaefb8583278365d8b5cfc118","target":"graph","created_at":"2026-05-18T00:19:08Z","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":"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","authors_text":"Alexander Aved, Ishfaq Ahmad, Li Sulimowicz","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.CV","submitted_at":"2018-04-05T19:31:03Z","title":"A Multi-Layer Approach to Superpixel-based Higher-order Conditional Random Field for Semantic Image Segmentation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.02032","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:356585708008615cb445be24236ced6182c500f65d5a6ab1e2ee73f89dc21d42","target":"record","created_at":"2026-05-18T00:19:08Z","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":"7d7c3276a954e6dfe1bb7a25bac46caf3cedb777dad2be2ae5ef0cdcd7d46806","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.CV","submitted_at":"2018-04-05T19:31:03Z","title_canon_sha256":"a9cb6b9a89264a1a57236d85987e220a0f0c6bdc3136acd4e73b4fd46f0b9fa9"},"schema_version":"1.0","source":{"id":"1804.02032","kind":"arxiv","version":1}},"canonical_sha256":"2de87dbd4f7f38b5d71771991ed075d6c96d3dc3a282393868619f622e47e150","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2de87dbd4f7f38b5d71771991ed075d6c96d3dc3a282393868619f622e47e150","first_computed_at":"2026-05-18T00:19:08.048488Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:19:08.048488Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YVbk3llidVanUXjM3WihjGFHfQETqtGOpoa27d0JWinXyW15YBlbu8l3+XFZQkVL90Y0qWClXNzR2mKIRupwCw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:19:08.049088Z","signed_message":"canonical_sha256_bytes"},"source_id":"1804.02032","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:356585708008615cb445be24236ced6182c500f65d5a6ab1e2ee73f89dc21d42","sha256:6f301aef72bac577873db8d12516739c864371ceaefb8583278365d8b5cfc118"],"state_sha256":"815bdafdf7dc3570bbdc79a3f400e0c4b30dacaefa8411cbc64900bda3d9d78e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RyGdWGzIuuzQhPgcs3QhQn/G13Pq6Eq0qIFIBWitJ1xf7xGH4mNHAkc9A4CfruDpyjwnWj4IPV/O6RHSqlEEDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T01:53:41.362023Z","bundle_sha256":"c3ca285aa5731cedc6f27e00ac2049e1ce7d564a6a481a9375a358a40239b713"}}