{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:GYMVZ6TCSPLK4NGYD2QH4DCUGE","short_pith_number":"pith:GYMVZ6TC","canonical_record":{"source":{"id":"1409.2104","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2014-09-07T10:43:36Z","cross_cats_sorted":[],"title_canon_sha256":"a5cadf521d435f2d6dc678c558e5502aae1825883ef07b5e21b58bcb06bc7531","abstract_canon_sha256":"8d40035becfb1a9d8e8ebb00bfc4cb5334db78655d4a2d0524813f5f2631fe81"},"schema_version":"1.0"},"canonical_sha256":"36195cfa6293d6ae34d81ea07e0c54312546e34883e39eef98989d1ebe181960","source":{"kind":"arxiv","id":"1409.2104","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.2104","created_at":"2026-05-18T01:42:07Z"},{"alias_kind":"arxiv_version","alias_value":"1409.2104v1","created_at":"2026-05-18T01:42:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.2104","created_at":"2026-05-18T01:42:07Z"},{"alias_kind":"pith_short_12","alias_value":"GYMVZ6TCSPLK","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_16","alias_value":"GYMVZ6TCSPLK4NGY","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_8","alias_value":"GYMVZ6TC","created_at":"2026-05-18T12:28:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:GYMVZ6TCSPLK4NGYD2QH4DCUGE","target":"record","payload":{"canonical_record":{"source":{"id":"1409.2104","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2014-09-07T10:43:36Z","cross_cats_sorted":[],"title_canon_sha256":"a5cadf521d435f2d6dc678c558e5502aae1825883ef07b5e21b58bcb06bc7531","abstract_canon_sha256":"8d40035becfb1a9d8e8ebb00bfc4cb5334db78655d4a2d0524813f5f2631fe81"},"schema_version":"1.0"},"canonical_sha256":"36195cfa6293d6ae34d81ea07e0c54312546e34883e39eef98989d1ebe181960","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:42:07.106012Z","signature_b64":"uX5FBIoEbRlPBjO8YXZREOYWdI3p9UQQWnkCI+3PB8mvIQXae+26XiFviD6VBIaBtwIcM3xrU7UgugtNrCFiAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"36195cfa6293d6ae34d81ea07e0c54312546e34883e39eef98989d1ebe181960","last_reissued_at":"2026-05-18T01:42:07.105334Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:42:07.105334Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1409.2104","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-18T01:42:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JkGGAKc1kivHnSVQeOUa3HysfPD/8XkfyA6IELqcL4neNzfSVKf8oxiRBM8OOuMN+GaU0bQ4RUpsx8p/mJhKAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T15:03:38.248783Z"},"content_sha256":"01ce2a0dacac3515821873955461be86c9b5974c532159cce5ca1afd4a0def71","schema_version":"1.0","event_id":"sha256:01ce2a0dacac3515821873955461be86c9b5974c532159cce5ca1afd4a0def71"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:GYMVZ6TCSPLK4NGYD2QH4DCUGE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Computational Model of the Short-Cut Rule for 2D Shape Decomposition","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Chunhua Shen, Chunyuan Zhang, Lei Luo, Xinwang Liu","submitted_at":"2014-09-07T10:43:36Z","abstract_excerpt":"We propose a new 2D shape decomposition method based on the short-cut rule. The short-cut rule originates from cognition research, and states that the human visual system prefers to partition an object into parts using the shortest possible cuts. We propose and implement a computational model for the short-cut rule and apply it to the problem of shape decomposition. The model we proposed generates a set of cut hypotheses passing through the points on the silhouette which represent the negative minima of curvature. We then show that most part-cut hypotheses can be eliminated by analysis of loca"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.2104","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-18T01:42:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"U7DMTLT2Iw3DkEle3u1iw843YyS3tFNFo+jmGhwWMNAkiejK0j7QUPMrn09qBKSI/rvOT+pcs2TG/VLr7QMiBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T15:03:38.249392Z"},"content_sha256":"5147853b9f29cb1fc61977f01e06b6860f14135569a528a4b341c2a941233572","schema_version":"1.0","event_id":"sha256:5147853b9f29cb1fc61977f01e06b6860f14135569a528a4b341c2a941233572"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GYMVZ6TCSPLK4NGYD2QH4DCUGE/bundle.json","state_url":"https://pith.science/pith/GYMVZ6TCSPLK4NGYD2QH4DCUGE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GYMVZ6TCSPLK4NGYD2QH4DCUGE/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-05-26T15:03:38Z","links":{"resolver":"https://pith.science/pith/GYMVZ6TCSPLK4NGYD2QH4DCUGE","bundle":"https://pith.science/pith/GYMVZ6TCSPLK4NGYD2QH4DCUGE/bundle.json","state":"https://pith.science/pith/GYMVZ6TCSPLK4NGYD2QH4DCUGE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GYMVZ6TCSPLK4NGYD2QH4DCUGE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:GYMVZ6TCSPLK4NGYD2QH4DCUGE","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":"8d40035becfb1a9d8e8ebb00bfc4cb5334db78655d4a2d0524813f5f2631fe81","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2014-09-07T10:43:36Z","title_canon_sha256":"a5cadf521d435f2d6dc678c558e5502aae1825883ef07b5e21b58bcb06bc7531"},"schema_version":"1.0","source":{"id":"1409.2104","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.2104","created_at":"2026-05-18T01:42:07Z"},{"alias_kind":"arxiv_version","alias_value":"1409.2104v1","created_at":"2026-05-18T01:42:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.2104","created_at":"2026-05-18T01:42:07Z"},{"alias_kind":"pith_short_12","alias_value":"GYMVZ6TCSPLK","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_16","alias_value":"GYMVZ6TCSPLK4NGY","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_8","alias_value":"GYMVZ6TC","created_at":"2026-05-18T12:28:30Z"}],"graph_snapshots":[{"event_id":"sha256:5147853b9f29cb1fc61977f01e06b6860f14135569a528a4b341c2a941233572","target":"graph","created_at":"2026-05-18T01:42:07Z","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 propose a new 2D shape decomposition method based on the short-cut rule. The short-cut rule originates from cognition research, and states that the human visual system prefers to partition an object into parts using the shortest possible cuts. We propose and implement a computational model for the short-cut rule and apply it to the problem of shape decomposition. The model we proposed generates a set of cut hypotheses passing through the points on the silhouette which represent the negative minima of curvature. We then show that most part-cut hypotheses can be eliminated by analysis of loca","authors_text":"Chunhua Shen, Chunyuan Zhang, Lei Luo, Xinwang Liu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2014-09-07T10:43:36Z","title":"A Computational Model of the Short-Cut Rule for 2D Shape Decomposition"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.2104","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:01ce2a0dacac3515821873955461be86c9b5974c532159cce5ca1afd4a0def71","target":"record","created_at":"2026-05-18T01:42:07Z","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":"8d40035becfb1a9d8e8ebb00bfc4cb5334db78655d4a2d0524813f5f2631fe81","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2014-09-07T10:43:36Z","title_canon_sha256":"a5cadf521d435f2d6dc678c558e5502aae1825883ef07b5e21b58bcb06bc7531"},"schema_version":"1.0","source":{"id":"1409.2104","kind":"arxiv","version":1}},"canonical_sha256":"36195cfa6293d6ae34d81ea07e0c54312546e34883e39eef98989d1ebe181960","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"36195cfa6293d6ae34d81ea07e0c54312546e34883e39eef98989d1ebe181960","first_computed_at":"2026-05-18T01:42:07.105334Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:42:07.105334Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"uX5FBIoEbRlPBjO8YXZREOYWdI3p9UQQWnkCI+3PB8mvIQXae+26XiFviD6VBIaBtwIcM3xrU7UgugtNrCFiAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:42:07.106012Z","signed_message":"canonical_sha256_bytes"},"source_id":"1409.2104","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:01ce2a0dacac3515821873955461be86c9b5974c532159cce5ca1afd4a0def71","sha256:5147853b9f29cb1fc61977f01e06b6860f14135569a528a4b341c2a941233572"],"state_sha256":"4c2f98742aa09858d89a67baabc10e6469f5af772cb6b8da90b71c1c2737b60e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OLLNBuLFb0GKNav4Mwrva3QvHlnoDfTPWJWseFhNTBPVyXXZj274tl3dRfCh3lcTNhRTrm7doDGcUAY43ZrtCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T15:03:38.252645Z","bundle_sha256":"b3b08ff85a20c44f6783f650818d56cf800f9fa5dee9742504e1ae5f1d6b725f"}}