{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:GALOHUGUAZQTVGEY4I457MIBXT","short_pith_number":"pith:GALOHUGU","canonical_record":{"source":{"id":"1302.6833","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-02-27T14:18:35Z","cross_cats_sorted":[],"title_canon_sha256":"00c1ca1d3667b64075c60f1459aab621609c9716f059fc4ad9d25087d2d9ba74","abstract_canon_sha256":"12cfe7cf0613b3d346e40cc215eb07e78d616af96f7b6e9bd5c64b583f3ee703"},"schema_version":"1.0"},"canonical_sha256":"3016e3d0d406613a9898e239dfb101bccaed4796e6befc9286241354f6fec2c5","source":{"kind":"arxiv","id":"1302.6833","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.6833","created_at":"2026-05-18T03:32:18Z"},{"alias_kind":"arxiv_version","alias_value":"1302.6833v1","created_at":"2026-05-18T03:32:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.6833","created_at":"2026-05-18T03:32:18Z"},{"alias_kind":"pith_short_12","alias_value":"GALOHUGUAZQT","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_16","alias_value":"GALOHUGUAZQTVGEY","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_8","alias_value":"GALOHUGU","created_at":"2026-05-18T12:27:45Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:GALOHUGUAZQTVGEY4I457MIBXT","target":"record","payload":{"canonical_record":{"source":{"id":"1302.6833","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-02-27T14:18:35Z","cross_cats_sorted":[],"title_canon_sha256":"00c1ca1d3667b64075c60f1459aab621609c9716f059fc4ad9d25087d2d9ba74","abstract_canon_sha256":"12cfe7cf0613b3d346e40cc215eb07e78d616af96f7b6e9bd5c64b583f3ee703"},"schema_version":"1.0"},"canonical_sha256":"3016e3d0d406613a9898e239dfb101bccaed4796e6befc9286241354f6fec2c5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:32:18.497788Z","signature_b64":"x/kglNmXqFLNM7pFbN+d+xPzdb0LUFdevEFIjTpbqEKo2RzqLyz+TDMeMOXBWY8WPyKHhxNUeHKoPTjxtjX2DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3016e3d0d406613a9898e239dfb101bccaed4796e6befc9286241354f6fec2c5","last_reissued_at":"2026-05-18T03:32:18.497338Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:32:18.497338Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1302.6833","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:32:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/374kZpknaoItyzPIZj4EEdRRhz+aMZyhxN0L2j0PdGkW0Y5IaFt56zX1mpk6vB7o4PZKUWBWPXWe0VtDxN7AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T03:20:40.055518Z"},"content_sha256":"4e222357d6a31b0bf9872aa358cc3d5f1c28524343081af40eb8fc9800093897","schema_version":"1.0","event_id":"sha256:4e222357d6a31b0bf9872aa358cc3d5f1c28524343081af40eb8fc9800093897"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:GALOHUGUAZQTVGEY4I457MIBXT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Incremental Dynamic Construction of Layered Polytree Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Keung-Chi Ng, Tod S. Levitt","submitted_at":"2013-02-27T14:18:35Z","abstract_excerpt":"Certain classes of problems, including perceptual data understanding, robotics, discovery, and learning, can be represented as incremental, dynamically constructed belief networks. These automatically constructed networks can be dynamically extended and modified as evidence of new individuals becomes available.  The main result of this paper is the incremental extension of the singly connected polytree network in such a way that the network retains its singly connected polytree structure after the changes.  The algorithm is deterministic and is guaranteed to have a complexity of single node ad"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.6833","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:32:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"S2q72WqZt6GQnwyDPKM2f1MR1hbQomyr8YHaPtxUe9cIWnqTQl6xX730JGJZ9dbG/0xLiHf1K8XRUX9bdxuJBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T03:20:40.056129Z"},"content_sha256":"0ffef02ca9983360b849a586aba2e8fcdd5053c3aa14a165a01040fd811e300d","schema_version":"1.0","event_id":"sha256:0ffef02ca9983360b849a586aba2e8fcdd5053c3aa14a165a01040fd811e300d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GALOHUGUAZQTVGEY4I457MIBXT/bundle.json","state_url":"https://pith.science/pith/GALOHUGUAZQTVGEY4I457MIBXT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GALOHUGUAZQTVGEY4I457MIBXT/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-25T03:20:40Z","links":{"resolver":"https://pith.science/pith/GALOHUGUAZQTVGEY4I457MIBXT","bundle":"https://pith.science/pith/GALOHUGUAZQTVGEY4I457MIBXT/bundle.json","state":"https://pith.science/pith/GALOHUGUAZQTVGEY4I457MIBXT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GALOHUGUAZQTVGEY4I457MIBXT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:GALOHUGUAZQTVGEY4I457MIBXT","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":"12cfe7cf0613b3d346e40cc215eb07e78d616af96f7b6e9bd5c64b583f3ee703","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-02-27T14:18:35Z","title_canon_sha256":"00c1ca1d3667b64075c60f1459aab621609c9716f059fc4ad9d25087d2d9ba74"},"schema_version":"1.0","source":{"id":"1302.6833","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.6833","created_at":"2026-05-18T03:32:18Z"},{"alias_kind":"arxiv_version","alias_value":"1302.6833v1","created_at":"2026-05-18T03:32:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.6833","created_at":"2026-05-18T03:32:18Z"},{"alias_kind":"pith_short_12","alias_value":"GALOHUGUAZQT","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_16","alias_value":"GALOHUGUAZQTVGEY","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_8","alias_value":"GALOHUGU","created_at":"2026-05-18T12:27:45Z"}],"graph_snapshots":[{"event_id":"sha256:0ffef02ca9983360b849a586aba2e8fcdd5053c3aa14a165a01040fd811e300d","target":"graph","created_at":"2026-05-18T03:32:18Z","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":"Certain classes of problems, including perceptual data understanding, robotics, discovery, and learning, can be represented as incremental, dynamically constructed belief networks. These automatically constructed networks can be dynamically extended and modified as evidence of new individuals becomes available.  The main result of this paper is the incremental extension of the singly connected polytree network in such a way that the network retains its singly connected polytree structure after the changes.  The algorithm is deterministic and is guaranteed to have a complexity of single node ad","authors_text":"Keung-Chi Ng, Tod S. Levitt","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-02-27T14:18:35Z","title":"Incremental Dynamic Construction of Layered Polytree Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.6833","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:4e222357d6a31b0bf9872aa358cc3d5f1c28524343081af40eb8fc9800093897","target":"record","created_at":"2026-05-18T03:32:18Z","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":"12cfe7cf0613b3d346e40cc215eb07e78d616af96f7b6e9bd5c64b583f3ee703","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-02-27T14:18:35Z","title_canon_sha256":"00c1ca1d3667b64075c60f1459aab621609c9716f059fc4ad9d25087d2d9ba74"},"schema_version":"1.0","source":{"id":"1302.6833","kind":"arxiv","version":1}},"canonical_sha256":"3016e3d0d406613a9898e239dfb101bccaed4796e6befc9286241354f6fec2c5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3016e3d0d406613a9898e239dfb101bccaed4796e6befc9286241354f6fec2c5","first_computed_at":"2026-05-18T03:32:18.497338Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:32:18.497338Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"x/kglNmXqFLNM7pFbN+d+xPzdb0LUFdevEFIjTpbqEKo2RzqLyz+TDMeMOXBWY8WPyKHhxNUeHKoPTjxtjX2DA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:32:18.497788Z","signed_message":"canonical_sha256_bytes"},"source_id":"1302.6833","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4e222357d6a31b0bf9872aa358cc3d5f1c28524343081af40eb8fc9800093897","sha256:0ffef02ca9983360b849a586aba2e8fcdd5053c3aa14a165a01040fd811e300d"],"state_sha256":"aa5b1baefbe7fb9618df9ed522f3bfe1f5c21fe8c93d4046bbc28b6703c56380"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"H/5a+/M8cvKYqd4FXGMxkrMSDXaGLcYHEqGKDXWm/ahPsbJcZPX/RPt064VIEJGqTYhTmb0KVv8K6sBQi2fwDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T03:20:40.059842Z","bundle_sha256":"b1d7c44f4dc282c200f5574bac81dcdb23698230879f77e9a6d3053de30cb791"}}