{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:TM3LLUN2FUVXMUHNK4QTMDJKV5","short_pith_number":"pith:TM3LLUN2","schema_version":"1.0","canonical_sha256":"9b36b5d1ba2d2b7650ed5721360d2aaf692bf462901b092bd3a4873c02839b5a","source":{"kind":"arxiv","id":"1611.08896","version":1},"attestation_state":"computed","paper":{"title":"Uniform Information Segmentation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Pablo M\\'arquez-Neila, Pascal Fua, Radhakrishna Achanta, Sabine S\\\"usstrunk","submitted_at":"2016-11-27T19:31:03Z","abstract_excerpt":"Size uniformity is one of the main criteria of superpixel methods. But size uniformity rarely conforms to the varying content of an image. The chosen size of the superpixels therefore represents a compromise - how to obtain the fewest superpixels without losing too much important detail. We propose that a more appropriate criterion for creating image segments is information uniformity. We introduce a novel method for segmenting an image based on this criterion. Since information is a natural way of measuring image complexity, our proposed algorithm leads to image segments that are smaller and "},"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":"1611.08896","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2016-11-27T19:31:03Z","cross_cats_sorted":[],"title_canon_sha256":"81b9a553eaf5ba939d260b7ea5a9ce7d683699b14444923c3e92b159bf3e579d","abstract_canon_sha256":"29ca3af8a8255243fc5c69fbd5508309c67ecfbb6ef985fa1ecf36f895aa3d07"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:56:29.906261Z","signature_b64":"I46wn4umLrpIny7DRet0XFtHWvLBEcbCYBytYs09VVuESLUSymVGDkUPQaA6SndvCx6aB+/hJYLLDX7732UBDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9b36b5d1ba2d2b7650ed5721360d2aaf692bf462901b092bd3a4873c02839b5a","last_reissued_at":"2026-05-18T00:56:29.905492Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:56:29.905492Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Uniform Information Segmentation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Pablo M\\'arquez-Neila, Pascal Fua, Radhakrishna Achanta, Sabine S\\\"usstrunk","submitted_at":"2016-11-27T19:31:03Z","abstract_excerpt":"Size uniformity is one of the main criteria of superpixel methods. But size uniformity rarely conforms to the varying content of an image. The chosen size of the superpixels therefore represents a compromise - how to obtain the fewest superpixels without losing too much important detail. We propose that a more appropriate criterion for creating image segments is information uniformity. We introduce a novel method for segmenting an image based on this criterion. Since information is a natural way of measuring image complexity, our proposed algorithm leads to image segments that are smaller and "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.08896","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":"1611.08896","created_at":"2026-05-18T00:56:29.905620+00:00"},{"alias_kind":"arxiv_version","alias_value":"1611.08896v1","created_at":"2026-05-18T00:56:29.905620+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.08896","created_at":"2026-05-18T00:56:29.905620+00:00"},{"alias_kind":"pith_short_12","alias_value":"TM3LLUN2FUVX","created_at":"2026-05-18T12:30:44.179134+00:00"},{"alias_kind":"pith_short_16","alias_value":"TM3LLUN2FUVXMUHN","created_at":"2026-05-18T12:30:44.179134+00:00"},{"alias_kind":"pith_short_8","alias_value":"TM3LLUN2","created_at":"2026-05-18T12:30:44.179134+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/TM3LLUN2FUVXMUHNK4QTMDJKV5","json":"https://pith.science/pith/TM3LLUN2FUVXMUHNK4QTMDJKV5.json","graph_json":"https://pith.science/api/pith-number/TM3LLUN2FUVXMUHNK4QTMDJKV5/graph.json","events_json":"https://pith.science/api/pith-number/TM3LLUN2FUVXMUHNK4QTMDJKV5/events.json","paper":"https://pith.science/paper/TM3LLUN2"},"agent_actions":{"view_html":"https://pith.science/pith/TM3LLUN2FUVXMUHNK4QTMDJKV5","download_json":"https://pith.science/pith/TM3LLUN2FUVXMUHNK4QTMDJKV5.json","view_paper":"https://pith.science/paper/TM3LLUN2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1611.08896&json=true","fetch_graph":"https://pith.science/api/pith-number/TM3LLUN2FUVXMUHNK4QTMDJKV5/graph.json","fetch_events":"https://pith.science/api/pith-number/TM3LLUN2FUVXMUHNK4QTMDJKV5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TM3LLUN2FUVXMUHNK4QTMDJKV5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TM3LLUN2FUVXMUHNK4QTMDJKV5/action/storage_attestation","attest_author":"https://pith.science/pith/TM3LLUN2FUVXMUHNK4QTMDJKV5/action/author_attestation","sign_citation":"https://pith.science/pith/TM3LLUN2FUVXMUHNK4QTMDJKV5/action/citation_signature","submit_replication":"https://pith.science/pith/TM3LLUN2FUVXMUHNK4QTMDJKV5/action/replication_record"}},"created_at":"2026-05-18T00:56:29.905620+00:00","updated_at":"2026-05-18T00:56:29.905620+00:00"}