{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:453QDVJQKH6XGVS6ZUBM6AMADH","short_pith_number":"pith:453QDVJQ","schema_version":"1.0","canonical_sha256":"e77701d53051fd73565ecd02cf018019de2dada5c44fec64312ef79c80439627","source":{"kind":"arxiv","id":"1203.2839","version":1},"attestation_state":"computed","paper":{"title":"Square-Cut: A Segmentation Algorithm on the Basis of a Rectangle Shape","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Bernd Freisleben, Christopher Nimsky, Dzenan Zukic, Jan Egger, Malgorzata Kolodziej, Thomas Dukatz, Tina Kapur","submitted_at":"2012-03-13T15:41:14Z","abstract_excerpt":"We present a rectangle-based segmentation algorithm that sets up a graph and performs a graph cut to separate an object from the background. However, graph-based algorithms distribute the graph's nodes uniformly and equidistantly on the image. Then, a smoothness term is added to force the cut to prefer a particular shape. This strategy does not allow the cut to prefer a certain structure, especially when areas of the object are indistinguishable from the background. We solve this problem by referring to a rectangle shape of the object when sampling the graph nodes, i.e., the nodes are distribu"},"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":"1203.2839","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2012-03-13T15:41:14Z","cross_cats_sorted":[],"title_canon_sha256":"e8193323b59b8fdeef29056b576b12728998e99fbcae086087e3fda01ebd0533","abstract_canon_sha256":"45388a0eb5530b39b1225c14908f9404b725cd4a3a3356b44ed4c0d141512919"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:00:14.425706Z","signature_b64":"S3n+3qSbHoW08xCJrWECXLvJooBgIEwYH24SC6m7/QWXoi+sprJa4LRKsRe6K4un0SlMwoWdbIbX5MEGpnYZDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e77701d53051fd73565ecd02cf018019de2dada5c44fec64312ef79c80439627","last_reissued_at":"2026-05-18T04:00:14.425062Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:00:14.425062Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Square-Cut: A Segmentation Algorithm on the Basis of a Rectangle Shape","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Bernd Freisleben, Christopher Nimsky, Dzenan Zukic, Jan Egger, Malgorzata Kolodziej, Thomas Dukatz, Tina Kapur","submitted_at":"2012-03-13T15:41:14Z","abstract_excerpt":"We present a rectangle-based segmentation algorithm that sets up a graph and performs a graph cut to separate an object from the background. However, graph-based algorithms distribute the graph's nodes uniformly and equidistantly on the image. Then, a smoothness term is added to force the cut to prefer a particular shape. This strategy does not allow the cut to prefer a certain structure, especially when areas of the object are indistinguishable from the background. We solve this problem by referring to a rectangle shape of the object when sampling the graph nodes, i.e., the nodes are distribu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.2839","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":"1203.2839","created_at":"2026-05-18T04:00:14.425175+00:00"},{"alias_kind":"arxiv_version","alias_value":"1203.2839v1","created_at":"2026-05-18T04:00:14.425175+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.2839","created_at":"2026-05-18T04:00:14.425175+00:00"},{"alias_kind":"pith_short_12","alias_value":"453QDVJQKH6X","created_at":"2026-05-18T12:26:53.410803+00:00"},{"alias_kind":"pith_short_16","alias_value":"453QDVJQKH6XGVS6","created_at":"2026-05-18T12:26:53.410803+00:00"},{"alias_kind":"pith_short_8","alias_value":"453QDVJQ","created_at":"2026-05-18T12:26:53.410803+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/453QDVJQKH6XGVS6ZUBM6AMADH","json":"https://pith.science/pith/453QDVJQKH6XGVS6ZUBM6AMADH.json","graph_json":"https://pith.science/api/pith-number/453QDVJQKH6XGVS6ZUBM6AMADH/graph.json","events_json":"https://pith.science/api/pith-number/453QDVJQKH6XGVS6ZUBM6AMADH/events.json","paper":"https://pith.science/paper/453QDVJQ"},"agent_actions":{"view_html":"https://pith.science/pith/453QDVJQKH6XGVS6ZUBM6AMADH","download_json":"https://pith.science/pith/453QDVJQKH6XGVS6ZUBM6AMADH.json","view_paper":"https://pith.science/paper/453QDVJQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1203.2839&json=true","fetch_graph":"https://pith.science/api/pith-number/453QDVJQKH6XGVS6ZUBM6AMADH/graph.json","fetch_events":"https://pith.science/api/pith-number/453QDVJQKH6XGVS6ZUBM6AMADH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/453QDVJQKH6XGVS6ZUBM6AMADH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/453QDVJQKH6XGVS6ZUBM6AMADH/action/storage_attestation","attest_author":"https://pith.science/pith/453QDVJQKH6XGVS6ZUBM6AMADH/action/author_attestation","sign_citation":"https://pith.science/pith/453QDVJQKH6XGVS6ZUBM6AMADH/action/citation_signature","submit_replication":"https://pith.science/pith/453QDVJQKH6XGVS6ZUBM6AMADH/action/replication_record"}},"created_at":"2026-05-18T04:00:14.425175+00:00","updated_at":"2026-05-18T04:00:14.425175+00:00"}