{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:QLYF77XJJVPNOZGE5DXSCWFRWJ","short_pith_number":"pith:QLYF77XJ","canonical_record":{"source":{"id":"1802.00088","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-01-31T22:37:46Z","cross_cats_sorted":[],"title_canon_sha256":"fd54872ab4d0a39ee5c68653141c125fe4c027cb14f426594ef48eb26a14ece1","abstract_canon_sha256":"92322901f93d5df433cedbea300060aec3a93356fb171e8cb9e62492a566d132"},"schema_version":"1.0"},"canonical_sha256":"82f05ffee94d5ed764c4e8ef2158b1b26781542143303bdb944c39d621ad4e68","source":{"kind":"arxiv","id":"1802.00088","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.00088","created_at":"2026-05-18T00:24:36Z"},{"alias_kind":"arxiv_version","alias_value":"1802.00088v1","created_at":"2026-05-18T00:24:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.00088","created_at":"2026-05-18T00:24:36Z"},{"alias_kind":"pith_short_12","alias_value":"QLYF77XJJVPN","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_16","alias_value":"QLYF77XJJVPNOZGE","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_8","alias_value":"QLYF77XJ","created_at":"2026-05-18T12:32:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:QLYF77XJJVPNOZGE5DXSCWFRWJ","target":"record","payload":{"canonical_record":{"source":{"id":"1802.00088","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-01-31T22:37:46Z","cross_cats_sorted":[],"title_canon_sha256":"fd54872ab4d0a39ee5c68653141c125fe4c027cb14f426594ef48eb26a14ece1","abstract_canon_sha256":"92322901f93d5df433cedbea300060aec3a93356fb171e8cb9e62492a566d132"},"schema_version":"1.0"},"canonical_sha256":"82f05ffee94d5ed764c4e8ef2158b1b26781542143303bdb944c39d621ad4e68","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:24:36.844615Z","signature_b64":"uu14wcrRnuXC9TJq4QHPJNDD3eF1P2zVSVx4ynbXZM5Byo7Dts68WC3VTVCfxbboNn8WIXhV+pSjFdndmB2RDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"82f05ffee94d5ed764c4e8ef2158b1b26781542143303bdb944c39d621ad4e68","last_reissued_at":"2026-05-18T00:24:36.843957Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:24:36.843957Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1802.00088","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:24:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kx8S+F5H/MDLWGIai3VpL1xb5SxaQLx/qHJvzMZ50g9CVtaTygMEhhBjgrUmwRNJD7rArOJMQqczHtM1/XyXCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T09:44:54.625153Z"},"content_sha256":"7a400eeca46374f4927302daf659ba26162ed2ccd5b58e456f08f7da5ef34b0a","schema_version":"1.0","event_id":"sha256:7a400eeca46374f4927302daf659ba26162ed2ccd5b58e456f08f7da5ef34b0a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:QLYF77XJJVPNOZGE5DXSCWFRWJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Improved Image Segmentation via Cost Minimization of Multiple Hypotheses","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Austin G. Dress, Christopher M. Gifford, Clare W. Lau, Gordon A. Christie, Jeffrey G. Skibo, Marc Bosch","submitted_at":"2018-01-31T22:37:46Z","abstract_excerpt":"Image segmentation is an important component of many image understanding systems. It aims to group pixels in a spatially and perceptually coherent manner. Typically, these algorithms have a collection of parameters that control the degree of over-segmentation produced. It still remains a challenge to properly select such parameters for human-like perceptual grouping. In this work, we exploit the diversity of segments produced by different choices of parameters. We scan the segmentation parameter space and generate a collection of image segmentation hypotheses (from highly over-segmented to und"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.00088","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:24:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hGHmmc1RB3w+SJ/yXH03WQIq0oMA7g6GWhalmnM/wMdSOgTVIKkg7vl3H8QoLoQGo4YuQNrVwm18WEcCwaTIDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T09:44:54.625508Z"},"content_sha256":"8ff7f41acaa7a475a7746a218e23cce7881af2821a7a29715afc83fb2d9a5395","schema_version":"1.0","event_id":"sha256:8ff7f41acaa7a475a7746a218e23cce7881af2821a7a29715afc83fb2d9a5395"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QLYF77XJJVPNOZGE5DXSCWFRWJ/bundle.json","state_url":"https://pith.science/pith/QLYF77XJJVPNOZGE5DXSCWFRWJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QLYF77XJJVPNOZGE5DXSCWFRWJ/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-25T09:44:54Z","links":{"resolver":"https://pith.science/pith/QLYF77XJJVPNOZGE5DXSCWFRWJ","bundle":"https://pith.science/pith/QLYF77XJJVPNOZGE5DXSCWFRWJ/bundle.json","state":"https://pith.science/pith/QLYF77XJJVPNOZGE5DXSCWFRWJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QLYF77XJJVPNOZGE5DXSCWFRWJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:QLYF77XJJVPNOZGE5DXSCWFRWJ","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":"92322901f93d5df433cedbea300060aec3a93356fb171e8cb9e62492a566d132","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-01-31T22:37:46Z","title_canon_sha256":"fd54872ab4d0a39ee5c68653141c125fe4c027cb14f426594ef48eb26a14ece1"},"schema_version":"1.0","source":{"id":"1802.00088","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.00088","created_at":"2026-05-18T00:24:36Z"},{"alias_kind":"arxiv_version","alias_value":"1802.00088v1","created_at":"2026-05-18T00:24:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.00088","created_at":"2026-05-18T00:24:36Z"},{"alias_kind":"pith_short_12","alias_value":"QLYF77XJJVPN","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_16","alias_value":"QLYF77XJJVPNOZGE","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_8","alias_value":"QLYF77XJ","created_at":"2026-05-18T12:32:46Z"}],"graph_snapshots":[{"event_id":"sha256:8ff7f41acaa7a475a7746a218e23cce7881af2821a7a29715afc83fb2d9a5395","target":"graph","created_at":"2026-05-18T00:24:36Z","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":"Image segmentation is an important component of many image understanding systems. It aims to group pixels in a spatially and perceptually coherent manner. Typically, these algorithms have a collection of parameters that control the degree of over-segmentation produced. It still remains a challenge to properly select such parameters for human-like perceptual grouping. In this work, we exploit the diversity of segments produced by different choices of parameters. We scan the segmentation parameter space and generate a collection of image segmentation hypotheses (from highly over-segmented to und","authors_text":"Austin G. Dress, Christopher M. Gifford, Clare W. Lau, Gordon A. Christie, Jeffrey G. Skibo, Marc Bosch","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-01-31T22:37:46Z","title":"Improved Image Segmentation via Cost Minimization of Multiple Hypotheses"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.00088","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:7a400eeca46374f4927302daf659ba26162ed2ccd5b58e456f08f7da5ef34b0a","target":"record","created_at":"2026-05-18T00:24:36Z","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":"92322901f93d5df433cedbea300060aec3a93356fb171e8cb9e62492a566d132","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-01-31T22:37:46Z","title_canon_sha256":"fd54872ab4d0a39ee5c68653141c125fe4c027cb14f426594ef48eb26a14ece1"},"schema_version":"1.0","source":{"id":"1802.00088","kind":"arxiv","version":1}},"canonical_sha256":"82f05ffee94d5ed764c4e8ef2158b1b26781542143303bdb944c39d621ad4e68","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"82f05ffee94d5ed764c4e8ef2158b1b26781542143303bdb944c39d621ad4e68","first_computed_at":"2026-05-18T00:24:36.843957Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:24:36.843957Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"uu14wcrRnuXC9TJq4QHPJNDD3eF1P2zVSVx4ynbXZM5Byo7Dts68WC3VTVCfxbboNn8WIXhV+pSjFdndmB2RDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:24:36.844615Z","signed_message":"canonical_sha256_bytes"},"source_id":"1802.00088","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7a400eeca46374f4927302daf659ba26162ed2ccd5b58e456f08f7da5ef34b0a","sha256:8ff7f41acaa7a475a7746a218e23cce7881af2821a7a29715afc83fb2d9a5395"],"state_sha256":"77b74169e888a9408c0677bda38903230bc26813ce1e23ffb15c23d577896f2f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jg7jMxfNhs5XRJyn42tmyn6G6Dw2LbkqJlNETBIg2B/sQ1/LgX3Nj5N6vI3enln0iHPiLpWdtwmjh1XX3mIOBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T09:44:54.627446Z","bundle_sha256":"28d8bf1e36be1a6a9a737103052f103afbdaec4516f109e7f5992857b6bb4bf2"}}