{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:453QDVJQKH6XGVS6ZUBM6AMADH","short_pith_number":"pith:453QDVJQ","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"},"canonical_sha256":"e77701d53051fd73565ecd02cf018019de2dada5c44fec64312ef79c80439627","source":{"kind":"arxiv","id":"1203.2839","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1203.2839","created_at":"2026-05-18T04:00:14Z"},{"alias_kind":"arxiv_version","alias_value":"1203.2839v1","created_at":"2026-05-18T04:00:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.2839","created_at":"2026-05-18T04:00:14Z"},{"alias_kind":"pith_short_12","alias_value":"453QDVJQKH6X","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_16","alias_value":"453QDVJQKH6XGVS6","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_8","alias_value":"453QDVJQ","created_at":"2026-05-18T12:26:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:453QDVJQKH6XGVS6ZUBM6AMADH","target":"record","payload":{"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"},"canonical_sha256":"e77701d53051fd73565ecd02cf018019de2dada5c44fec64312ef79c80439627","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"},"source_kind":"arxiv","source_id":"1203.2839","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-18T04:00:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fKFYmwxsXiz/u+x8WoTqm1xaUlNb0K4OGcFgtymDrxduMRqR9gEcEgdrHwkQfmMnRHyD0gLR/WdYnBW7qbvPBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T18:23:13.309900Z"},"content_sha256":"ef03435029aa489912e714c3c2a01b85d353449838d33865a7a5bc204694a858","schema_version":"1.0","event_id":"sha256:ef03435029aa489912e714c3c2a01b85d353449838d33865a7a5bc204694a858"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:453QDVJQKH6XGVS6ZUBM6AMADH","target":"graph","payload":{"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"},"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-18T04:00:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9Jv56R/8iI75CFP7k5aZ7/FNg/HkiOgGiDZHQfyh/uQaFfn4n3F8Yi6U6bao5tofDLN2oa81Hjl6F4fMBzT9Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T18:23:13.310243Z"},"content_sha256":"9c77b6a0641c03dda7aabd30768d3385947f22030e0647126fbf1946fea3661e","schema_version":"1.0","event_id":"sha256:9c77b6a0641c03dda7aabd30768d3385947f22030e0647126fbf1946fea3661e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/453QDVJQKH6XGVS6ZUBM6AMADH/bundle.json","state_url":"https://pith.science/pith/453QDVJQKH6XGVS6ZUBM6AMADH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/453QDVJQKH6XGVS6ZUBM6AMADH/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-03T18:23:13Z","links":{"resolver":"https://pith.science/pith/453QDVJQKH6XGVS6ZUBM6AMADH","bundle":"https://pith.science/pith/453QDVJQKH6XGVS6ZUBM6AMADH/bundle.json","state":"https://pith.science/pith/453QDVJQKH6XGVS6ZUBM6AMADH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/453QDVJQKH6XGVS6ZUBM6AMADH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:453QDVJQKH6XGVS6ZUBM6AMADH","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":"45388a0eb5530b39b1225c14908f9404b725cd4a3a3356b44ed4c0d141512919","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2012-03-13T15:41:14Z","title_canon_sha256":"e8193323b59b8fdeef29056b576b12728998e99fbcae086087e3fda01ebd0533"},"schema_version":"1.0","source":{"id":"1203.2839","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1203.2839","created_at":"2026-05-18T04:00:14Z"},{"alias_kind":"arxiv_version","alias_value":"1203.2839v1","created_at":"2026-05-18T04:00:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.2839","created_at":"2026-05-18T04:00:14Z"},{"alias_kind":"pith_short_12","alias_value":"453QDVJQKH6X","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_16","alias_value":"453QDVJQKH6XGVS6","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_8","alias_value":"453QDVJQ","created_at":"2026-05-18T12:26:53Z"}],"graph_snapshots":[{"event_id":"sha256:9c77b6a0641c03dda7aabd30768d3385947f22030e0647126fbf1946fea3661e","target":"graph","created_at":"2026-05-18T04:00:14Z","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":"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","authors_text":"Bernd Freisleben, Christopher Nimsky, Dzenan Zukic, Jan Egger, Malgorzata Kolodziej, Thomas Dukatz, Tina Kapur","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2012-03-13T15:41:14Z","title":"Square-Cut: A Segmentation Algorithm on the Basis of a Rectangle Shape"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.2839","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:ef03435029aa489912e714c3c2a01b85d353449838d33865a7a5bc204694a858","target":"record","created_at":"2026-05-18T04:00:14Z","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":"45388a0eb5530b39b1225c14908f9404b725cd4a3a3356b44ed4c0d141512919","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2012-03-13T15:41:14Z","title_canon_sha256":"e8193323b59b8fdeef29056b576b12728998e99fbcae086087e3fda01ebd0533"},"schema_version":"1.0","source":{"id":"1203.2839","kind":"arxiv","version":1}},"canonical_sha256":"e77701d53051fd73565ecd02cf018019de2dada5c44fec64312ef79c80439627","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e77701d53051fd73565ecd02cf018019de2dada5c44fec64312ef79c80439627","first_computed_at":"2026-05-18T04:00:14.425062Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:00:14.425062Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"S3n+3qSbHoW08xCJrWECXLvJooBgIEwYH24SC6m7/QWXoi+sprJa4LRKsRe6K4un0SlMwoWdbIbX5MEGpnYZDg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:00:14.425706Z","signed_message":"canonical_sha256_bytes"},"source_id":"1203.2839","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ef03435029aa489912e714c3c2a01b85d353449838d33865a7a5bc204694a858","sha256:9c77b6a0641c03dda7aabd30768d3385947f22030e0647126fbf1946fea3661e"],"state_sha256":"6f11174ab7bd16c6adf0922cb58ef3aafdb2c3c712e167bdceac3d4dbb004012"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iCWohhjnLQgsV0vDqlXErnXsXSKXuEo4u6zrF1FzHkm4jf8GneKObguL/C+6qyQarco9yb2XUjv2EOdaA9deCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T18:23:13.312279Z","bundle_sha256":"4a7d39bc1b84d76fc9e88db5237674ca69edc3e375e8265141fe1e2df6147475"}}