{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:C5EQIY7DH63XINGFUM2EUYOEAK","short_pith_number":"pith:C5EQIY7D","canonical_record":{"source":{"id":"1301.3560","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2013-01-16T02:29:15Z","cross_cats_sorted":[],"title_canon_sha256":"01764717b8b2edd2f86581929c04870dc0bb72502e2a06da40ad6db855045f1c","abstract_canon_sha256":"d609beb806812efa6d1bed2c197ae9a8e7305ae151b3910aef0605cd16e21fa8"},"schema_version":"1.0"},"canonical_sha256":"17490463e33fb77434c5a3344a61c402b8c23dd47cf548b26c27544e83b05d8b","source":{"kind":"arxiv","id":"1301.3560","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.3560","created_at":"2026-05-18T03:36:17Z"},{"alias_kind":"arxiv_version","alias_value":"1301.3560v1","created_at":"2026-05-18T03:36:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.3560","created_at":"2026-05-18T03:36:17Z"},{"alias_kind":"pith_short_12","alias_value":"C5EQIY7DH63X","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_16","alias_value":"C5EQIY7DH63XINGF","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_8","alias_value":"C5EQIY7D","created_at":"2026-05-18T12:27:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:C5EQIY7DH63XINGFUM2EUYOEAK","target":"record","payload":{"canonical_record":{"source":{"id":"1301.3560","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2013-01-16T02:29:15Z","cross_cats_sorted":[],"title_canon_sha256":"01764717b8b2edd2f86581929c04870dc0bb72502e2a06da40ad6db855045f1c","abstract_canon_sha256":"d609beb806812efa6d1bed2c197ae9a8e7305ae151b3910aef0605cd16e21fa8"},"schema_version":"1.0"},"canonical_sha256":"17490463e33fb77434c5a3344a61c402b8c23dd47cf548b26c27544e83b05d8b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:36:17.446558Z","signature_b64":"sXmZbonQ4M/lr6XpEDPWm7n86i/pA+gCe6oq0BO4aU6n38kgjc9jSS1BsinEEQFdfLZgNTzrOYTrCyZrwXzADQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"17490463e33fb77434c5a3344a61c402b8c23dd47cf548b26c27544e83b05d8b","last_reissued_at":"2026-05-18T03:36:17.446017Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:36:17.446017Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1301.3560","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-18T03:36:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"37h/EpxHXcKWwBbdO7WT0NSa01WVkXEQrJCEY2Uez0VFsH0Ja5UoaTkJPemdG6lHPl3EPZvBbu1GGEASucq3DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T03:25:22.911102Z"},"content_sha256":"5a07e48d070444ee98fc11776b92a13024d41fccc49905c7b542c50caac250d4","schema_version":"1.0","event_id":"sha256:5a07e48d070444ee98fc11776b92a13024d41fccc49905c7b542c50caac250d4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:C5EQIY7DH63XINGFUM2EUYOEAK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Complexity of Representation and Inference in Compositional Models with Part Sharing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Alan L. Yuille, Roozbeh Mottaghi","submitted_at":"2013-01-16T02:29:15Z","abstract_excerpt":"This paper describes serial and parallel compositional models of multiple objects with part sharing. Objects are built by part-subpart compositions and expressed in terms of a hierarchical dictionary of object parts. These parts are represented on lattices of decreasing sizes which yield an executive summary description. We describe inference and learning algorithms for these models. We analyze the complexity of this model in terms of computation time (for serial computers) and numbers of nodes (e.g., \"neurons\") for parallel computers. In particular, we compute the complexity gains by part sha"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.3560","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-18T03:36:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"V8sxWTtKej5LFHssshc9cpKtjtzNEDxjx+BZVdndy24PYfBfzSijmkl8zJgXJZufGRRL/1eykatETPi0Yfr9Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T03:25:22.911594Z"},"content_sha256":"078c89101ad3e51d07a1fe0beabfdf2429da31aeb09c717499c5cf5f2686872b","schema_version":"1.0","event_id":"sha256:078c89101ad3e51d07a1fe0beabfdf2429da31aeb09c717499c5cf5f2686872b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/C5EQIY7DH63XINGFUM2EUYOEAK/bundle.json","state_url":"https://pith.science/pith/C5EQIY7DH63XINGFUM2EUYOEAK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/C5EQIY7DH63XINGFUM2EUYOEAK/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-01T03:25:22Z","links":{"resolver":"https://pith.science/pith/C5EQIY7DH63XINGFUM2EUYOEAK","bundle":"https://pith.science/pith/C5EQIY7DH63XINGFUM2EUYOEAK/bundle.json","state":"https://pith.science/pith/C5EQIY7DH63XINGFUM2EUYOEAK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/C5EQIY7DH63XINGFUM2EUYOEAK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:C5EQIY7DH63XINGFUM2EUYOEAK","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":"d609beb806812efa6d1bed2c197ae9a8e7305ae151b3910aef0605cd16e21fa8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2013-01-16T02:29:15Z","title_canon_sha256":"01764717b8b2edd2f86581929c04870dc0bb72502e2a06da40ad6db855045f1c"},"schema_version":"1.0","source":{"id":"1301.3560","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.3560","created_at":"2026-05-18T03:36:17Z"},{"alias_kind":"arxiv_version","alias_value":"1301.3560v1","created_at":"2026-05-18T03:36:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.3560","created_at":"2026-05-18T03:36:17Z"},{"alias_kind":"pith_short_12","alias_value":"C5EQIY7DH63X","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_16","alias_value":"C5EQIY7DH63XINGF","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_8","alias_value":"C5EQIY7D","created_at":"2026-05-18T12:27:40Z"}],"graph_snapshots":[{"event_id":"sha256:078c89101ad3e51d07a1fe0beabfdf2429da31aeb09c717499c5cf5f2686872b","target":"graph","created_at":"2026-05-18T03:36:17Z","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":"This paper describes serial and parallel compositional models of multiple objects with part sharing. Objects are built by part-subpart compositions and expressed in terms of a hierarchical dictionary of object parts. These parts are represented on lattices of decreasing sizes which yield an executive summary description. We describe inference and learning algorithms for these models. We analyze the complexity of this model in terms of computation time (for serial computers) and numbers of nodes (e.g., \"neurons\") for parallel computers. In particular, we compute the complexity gains by part sha","authors_text":"Alan L. Yuille, Roozbeh Mottaghi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2013-01-16T02:29:15Z","title":"Complexity of Representation and Inference in Compositional Models with Part Sharing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.3560","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:5a07e48d070444ee98fc11776b92a13024d41fccc49905c7b542c50caac250d4","target":"record","created_at":"2026-05-18T03:36:17Z","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":"d609beb806812efa6d1bed2c197ae9a8e7305ae151b3910aef0605cd16e21fa8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2013-01-16T02:29:15Z","title_canon_sha256":"01764717b8b2edd2f86581929c04870dc0bb72502e2a06da40ad6db855045f1c"},"schema_version":"1.0","source":{"id":"1301.3560","kind":"arxiv","version":1}},"canonical_sha256":"17490463e33fb77434c5a3344a61c402b8c23dd47cf548b26c27544e83b05d8b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"17490463e33fb77434c5a3344a61c402b8c23dd47cf548b26c27544e83b05d8b","first_computed_at":"2026-05-18T03:36:17.446017Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:36:17.446017Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"sXmZbonQ4M/lr6XpEDPWm7n86i/pA+gCe6oq0BO4aU6n38kgjc9jSS1BsinEEQFdfLZgNTzrOYTrCyZrwXzADQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:36:17.446558Z","signed_message":"canonical_sha256_bytes"},"source_id":"1301.3560","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5a07e48d070444ee98fc11776b92a13024d41fccc49905c7b542c50caac250d4","sha256:078c89101ad3e51d07a1fe0beabfdf2429da31aeb09c717499c5cf5f2686872b"],"state_sha256":"8078482ed93c8faba5da9da5d10d6de6f42dcedbbf579516cfd0e531f56ccbc1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wAmtO6XPmHxH23jB74V5E0wbos2cRfzwBjCFP6rr/aN4JPPqohefVSQe0w198xVXB18d5jEdaCWyhmWh9JQDDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T03:25:22.914716Z","bundle_sha256":"e794869e3985167df594086270db0d39ab684e55a08a841c2708fa6265698175"}}