{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:3XDZCWL2G4MFEKOINSEI74FOPW","short_pith_number":"pith:3XDZCWL2","schema_version":"1.0","canonical_sha256":"ddc791597a37185229c86c888ff0ae7d8a766e632410a85e892f2ea0d4801165","source":{"kind":"arxiv","id":"2406.20081","version":1},"attestation_state":"computed","paper":{"title":"Segment Anything without Supervision","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.CV","authors_text":"Jingfeng Yang, Trevor Darrell, Xudong Wang","submitted_at":"2024-06-28T17:47:32Z","abstract_excerpt":"The Segmentation Anything Model (SAM) requires labor-intensive data labeling. We present Unsupervised SAM (UnSAM) for promptable and automatic whole-image segmentation that does not require human annotations. UnSAM utilizes a divide-and-conquer strategy to \"discover\" the hierarchical structure of visual scenes. We first leverage top-down clustering methods to partition an unlabeled image into instance/semantic level segments. For all pixels within a segment, a bottom-up clustering method is employed to iteratively merge them into larger groups, thereby forming a hierarchical structure. These u"},"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":"2406.20081","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CV","submitted_at":"2024-06-28T17:47:32Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"cf2603b59639c7643ef86756af95b4245e45b1a0d44ece74a45aa746df3f06f1","abstract_canon_sha256":"edf794b83763a84d6037e1f7a8f79c0eef59d343a13c053e229ebfd6e28d5d6a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:37:58.890422Z","signature_b64":"E9XYmtDmwOSGczDr4MO7W5hBhwk4/eHE9xJQHhdDLSZAgV2EMIifWBsjFJAI+8x5VpNYAcBIPUGJjtZuaBl2Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ddc791597a37185229c86c888ff0ae7d8a766e632410a85e892f2ea0d4801165","last_reissued_at":"2026-07-05T08:37:58.889933Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:37:58.889933Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Segment Anything without Supervision","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.CV","authors_text":"Jingfeng Yang, Trevor Darrell, Xudong Wang","submitted_at":"2024-06-28T17:47:32Z","abstract_excerpt":"The Segmentation Anything Model (SAM) requires labor-intensive data labeling. We present Unsupervised SAM (UnSAM) for promptable and automatic whole-image segmentation that does not require human annotations. UnSAM utilizes a divide-and-conquer strategy to \"discover\" the hierarchical structure of visual scenes. We first leverage top-down clustering methods to partition an unlabeled image into instance/semantic level segments. For all pixels within a segment, a bottom-up clustering method is employed to iteratively merge them into larger groups, thereby forming a hierarchical structure. These u"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2406.20081","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2406.20081/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2406.20081","created_at":"2026-07-05T08:37:58.889997+00:00"},{"alias_kind":"arxiv_version","alias_value":"2406.20081v1","created_at":"2026-07-05T08:37:58.889997+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2406.20081","created_at":"2026-07-05T08:37:58.889997+00:00"},{"alias_kind":"pith_short_12","alias_value":"3XDZCWL2G4MF","created_at":"2026-07-05T08:37:58.889997+00:00"},{"alias_kind":"pith_short_16","alias_value":"3XDZCWL2G4MFEKOI","created_at":"2026-07-05T08:37:58.889997+00:00"},{"alias_kind":"pith_short_8","alias_value":"3XDZCWL2","created_at":"2026-07-05T08:37:58.889997+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.15008","citing_title":"FastSmoothSAM: A Fast Smooth Method For Segment Anything Model","ref_index":25,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/3XDZCWL2G4MFEKOINSEI74FOPW","json":"https://pith.science/pith/3XDZCWL2G4MFEKOINSEI74FOPW.json","graph_json":"https://pith.science/api/pith-number/3XDZCWL2G4MFEKOINSEI74FOPW/graph.json","events_json":"https://pith.science/api/pith-number/3XDZCWL2G4MFEKOINSEI74FOPW/events.json","paper":"https://pith.science/paper/3XDZCWL2"},"agent_actions":{"view_html":"https://pith.science/pith/3XDZCWL2G4MFEKOINSEI74FOPW","download_json":"https://pith.science/pith/3XDZCWL2G4MFEKOINSEI74FOPW.json","view_paper":"https://pith.science/paper/3XDZCWL2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2406.20081&json=true","fetch_graph":"https://pith.science/api/pith-number/3XDZCWL2G4MFEKOINSEI74FOPW/graph.json","fetch_events":"https://pith.science/api/pith-number/3XDZCWL2G4MFEKOINSEI74FOPW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3XDZCWL2G4MFEKOINSEI74FOPW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3XDZCWL2G4MFEKOINSEI74FOPW/action/storage_attestation","attest_author":"https://pith.science/pith/3XDZCWL2G4MFEKOINSEI74FOPW/action/author_attestation","sign_citation":"https://pith.science/pith/3XDZCWL2G4MFEKOINSEI74FOPW/action/citation_signature","submit_replication":"https://pith.science/pith/3XDZCWL2G4MFEKOINSEI74FOPW/action/replication_record"}},"created_at":"2026-07-05T08:37:58.889997+00:00","updated_at":"2026-07-05T08:37:58.889997+00:00"}