{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:AXPDHVQIMYX72MGIBDO3ATHDPL","short_pith_number":"pith:AXPDHVQI","canonical_record":{"source":{"id":"1804.07836","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-04-20T21:40:57Z","cross_cats_sorted":[],"title_canon_sha256":"dc734821aae2d57de5d1b03e30f8d3874d1ed057c91fd92cd469dac857150da6","abstract_canon_sha256":"0d6a8b348feadda145f3e75884c3010fbf2eb3b57ba186f8eec4e95feb9d3bb3"},"schema_version":"1.0"},"canonical_sha256":"05de33d608662ffd30c808ddb04ce37aee70e038e1c2010180c226ab7c082552","source":{"kind":"arxiv","id":"1804.07836","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.07836","created_at":"2026-05-17T23:54:16Z"},{"alias_kind":"arxiv_version","alias_value":"1804.07836v2","created_at":"2026-05-17T23:54:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.07836","created_at":"2026-05-17T23:54:16Z"},{"alias_kind":"pith_short_12","alias_value":"AXPDHVQIMYX7","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"AXPDHVQIMYX72MGI","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"AXPDHVQI","created_at":"2026-05-18T12:32:13Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:AXPDHVQIMYX72MGIBDO3ATHDPL","target":"record","payload":{"canonical_record":{"source":{"id":"1804.07836","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-04-20T21:40:57Z","cross_cats_sorted":[],"title_canon_sha256":"dc734821aae2d57de5d1b03e30f8d3874d1ed057c91fd92cd469dac857150da6","abstract_canon_sha256":"0d6a8b348feadda145f3e75884c3010fbf2eb3b57ba186f8eec4e95feb9d3bb3"},"schema_version":"1.0"},"canonical_sha256":"05de33d608662ffd30c808ddb04ce37aee70e038e1c2010180c226ab7c082552","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:54:16.544409Z","signature_b64":"iILhXe0PrkjHZBwVC6upqKX1WMZWa303UdoKJ+3hhpXXNBnmWaV0+v4qPGSQmiEX68fuI4iCKq88qSYiwlXmBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"05de33d608662ffd30c808ddb04ce37aee70e038e1c2010180c226ab7c082552","last_reissued_at":"2026-05-17T23:54:16.543753Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:54:16.543753Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1804.07836","source_version":2,"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-17T23:54:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ETI1doYR9mbOsiNZQ1XbtH6RxwjLfvIsGgbvJQGOI2Rv5fhfmDytPM6+N6vKTN5B4iYPZZMXukwzVExDeGGkBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T00:15:18.318176Z"},"content_sha256":"3ca2bba78b85f3a970396fc612f4de4f8e7ff1b999de5fe00aa6fdf0a8283517","schema_version":"1.0","event_id":"sha256:3ca2bba78b85f3a970396fc612f4de4f8e7ff1b999de5fe00aa6fdf0a8283517"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:AXPDHVQIMYX72MGIBDO3ATHDPL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"ConnNet: A Long-Range Relation-Aware Pixel-Connectivity Network for Salient Segmentation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Eric P. Xing, Michael Kampffmeyer, Nanqing Dong, Xiaodan Liang, Yujia Zhang","submitted_at":"2018-04-20T21:40:57Z","abstract_excerpt":"Salient segmentation aims to segment out attention-grabbing regions, a critical yet challenging task and the foundation of many high-level computer vision applications. It requires semantic-aware grouping of pixels into salient regions and benefits from the utilization of global multi-scale contexts to achieve good local reasoning. Previous works often address it as two-class segmentation problems utilizing complicated multi-step procedures including refinement networks and complex graphical models. We argue that semantic salient segmentation can instead be effectively resolved by reformulatin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.07836","kind":"arxiv","version":2},"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-17T23:54:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xp1tB2hf1U/QecSqPUR2bh6ujsd8Q76Oa98DrO74kdb/9CFgEYVLegxBlhv0ZHC9PjDOVfoinyyHY84YudJCAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T00:15:18.318855Z"},"content_sha256":"56ac0e15b727d499d344f2e3828b5f78b4e09c0c09d43f1b434396eb72861c12","schema_version":"1.0","event_id":"sha256:56ac0e15b727d499d344f2e3828b5f78b4e09c0c09d43f1b434396eb72861c12"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AXPDHVQIMYX72MGIBDO3ATHDPL/bundle.json","state_url":"https://pith.science/pith/AXPDHVQIMYX72MGIBDO3ATHDPL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AXPDHVQIMYX72MGIBDO3ATHDPL/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-05-26T00:15:18Z","links":{"resolver":"https://pith.science/pith/AXPDHVQIMYX72MGIBDO3ATHDPL","bundle":"https://pith.science/pith/AXPDHVQIMYX72MGIBDO3ATHDPL/bundle.json","state":"https://pith.science/pith/AXPDHVQIMYX72MGIBDO3ATHDPL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AXPDHVQIMYX72MGIBDO3ATHDPL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:AXPDHVQIMYX72MGIBDO3ATHDPL","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":"0d6a8b348feadda145f3e75884c3010fbf2eb3b57ba186f8eec4e95feb9d3bb3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-04-20T21:40:57Z","title_canon_sha256":"dc734821aae2d57de5d1b03e30f8d3874d1ed057c91fd92cd469dac857150da6"},"schema_version":"1.0","source":{"id":"1804.07836","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.07836","created_at":"2026-05-17T23:54:16Z"},{"alias_kind":"arxiv_version","alias_value":"1804.07836v2","created_at":"2026-05-17T23:54:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.07836","created_at":"2026-05-17T23:54:16Z"},{"alias_kind":"pith_short_12","alias_value":"AXPDHVQIMYX7","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"AXPDHVQIMYX72MGI","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"AXPDHVQI","created_at":"2026-05-18T12:32:13Z"}],"graph_snapshots":[{"event_id":"sha256:56ac0e15b727d499d344f2e3828b5f78b4e09c0c09d43f1b434396eb72861c12","target":"graph","created_at":"2026-05-17T23:54:16Z","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":"Salient segmentation aims to segment out attention-grabbing regions, a critical yet challenging task and the foundation of many high-level computer vision applications. It requires semantic-aware grouping of pixels into salient regions and benefits from the utilization of global multi-scale contexts to achieve good local reasoning. Previous works often address it as two-class segmentation problems utilizing complicated multi-step procedures including refinement networks and complex graphical models. We argue that semantic salient segmentation can instead be effectively resolved by reformulatin","authors_text":"Eric P. Xing, Michael Kampffmeyer, Nanqing Dong, Xiaodan Liang, Yujia Zhang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-04-20T21:40:57Z","title":"ConnNet: A Long-Range Relation-Aware Pixel-Connectivity Network for Salient Segmentation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.07836","kind":"arxiv","version":2},"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:3ca2bba78b85f3a970396fc612f4de4f8e7ff1b999de5fe00aa6fdf0a8283517","target":"record","created_at":"2026-05-17T23:54:16Z","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":"0d6a8b348feadda145f3e75884c3010fbf2eb3b57ba186f8eec4e95feb9d3bb3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-04-20T21:40:57Z","title_canon_sha256":"dc734821aae2d57de5d1b03e30f8d3874d1ed057c91fd92cd469dac857150da6"},"schema_version":"1.0","source":{"id":"1804.07836","kind":"arxiv","version":2}},"canonical_sha256":"05de33d608662ffd30c808ddb04ce37aee70e038e1c2010180c226ab7c082552","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"05de33d608662ffd30c808ddb04ce37aee70e038e1c2010180c226ab7c082552","first_computed_at":"2026-05-17T23:54:16.543753Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:54:16.543753Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"iILhXe0PrkjHZBwVC6upqKX1WMZWa303UdoKJ+3hhpXXNBnmWaV0+v4qPGSQmiEX68fuI4iCKq88qSYiwlXmBA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:54:16.544409Z","signed_message":"canonical_sha256_bytes"},"source_id":"1804.07836","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3ca2bba78b85f3a970396fc612f4de4f8e7ff1b999de5fe00aa6fdf0a8283517","sha256:56ac0e15b727d499d344f2e3828b5f78b4e09c0c09d43f1b434396eb72861c12"],"state_sha256":"34d018796d2a65d3cdef01f9770f4ae20ba74a27e1ed4310e2fc1f22afb0b071"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lnHNelAR8J41lV8ym86jZayX6cEQ9JITUo0WP4QLayoLx+M6eucye0KKGYqhYQMpGNFwsl8SK+J0EmBDsclYAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T00:15:18.322222Z","bundle_sha256":"c7650f343ba13c64196aba09a92cb2c35b3bc541db79f573e92d6de0e4546d4d"}}