{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:GYMVZ6TCSPLK4NGYD2QH4DCUGE","short_pith_number":"pith:GYMVZ6TC","schema_version":"1.0","canonical_sha256":"36195cfa6293d6ae34d81ea07e0c54312546e34883e39eef98989d1ebe181960","source":{"kind":"arxiv","id":"1409.2104","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1409.2104","created_at":"2026-05-18T01:42:07.105483+00:00"},{"alias_kind":"arxiv_version","alias_value":"1409.2104v1","created_at":"2026-05-18T01:42:07.105483+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.2104","created_at":"2026-05-18T01:42:07.105483+00:00"},{"alias_kind":"pith_short_12","alias_value":"GYMVZ6TCSPLK","created_at":"2026-05-18T12:28:30.664211+00:00"},{"alias_kind":"pith_short_16","alias_value":"GYMVZ6TCSPLK4NGY","created_at":"2026-05-18T12:28:30.664211+00:00"},{"alias_kind":"pith_short_8","alias_value":"GYMVZ6TC","created_at":"2026-05-18T12:28:30.664211+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/GYMVZ6TCSPLK4NGYD2QH4DCUGE","json":"https://pith.science/pith/GYMVZ6TCSPLK4NGYD2QH4DCUGE.json","graph_json":"https://pith.science/api/pith-number/GYMVZ6TCSPLK4NGYD2QH4DCUGE/graph.json","events_json":"https://pith.science/api/pith-number/GYMVZ6TCSPLK4NGYD2QH4DCUGE/events.json","paper":"https://pith.science/paper/GYMVZ6TC"},"agent_actions":{"view_html":"https://pith.science/pith/GYMVZ6TCSPLK4NGYD2QH4DCUGE","download_json":"https://pith.science/pith/GYMVZ6TCSPLK4NGYD2QH4DCUGE.json","view_paper":"https://pith.science/paper/GYMVZ6TC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1409.2104&json=true","fetch_graph":"https://pith.science/api/pith-number/GYMVZ6TCSPLK4NGYD2QH4DCUGE/graph.json","fetch_events":"https://pith.science/api/pith-number/GYMVZ6TCSPLK4NGYD2QH4DCUGE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GYMVZ6TCSPLK4NGYD2QH4DCUGE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GYMVZ6TCSPLK4NGYD2QH4DCUGE/action/storage_attestation","attest_author":"https://pith.science/pith/GYMVZ6TCSPLK4NGYD2QH4DCUGE/action/author_attestation","sign_citation":"https://pith.science/pith/GYMVZ6TCSPLK4NGYD2QH4DCUGE/action/citation_signature","submit_replication":"https://pith.science/pith/GYMVZ6TCSPLK4NGYD2QH4DCUGE/action/replication_record"}},"created_at":"2026-05-18T01:42:07.105483+00:00","updated_at":"2026-05-18T01:42:07.105483+00:00"}