{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:I5XPCBKA7Z7IQ6XKMXB6J2K7Q5","short_pith_number":"pith:I5XPCBKA","canonical_record":{"source":{"id":"1810.11982","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-10-29T07:33:31Z","cross_cats_sorted":[],"title_canon_sha256":"036945df4f32bf5cd730c6f889b189df41bd0302871411d3ce491628e2bd6c43","abstract_canon_sha256":"5be337f02d6341bf3a2eeeac16c2418a4ce0b22a327855001d9387ad319cc227"},"schema_version":"1.0"},"canonical_sha256":"476ef10540fe7e887aea65c3e4e95f87682bf937e1c23078a0e7458afeb962ac","source":{"kind":"arxiv","id":"1810.11982","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.11982","created_at":"2026-05-18T00:02:06Z"},{"alias_kind":"arxiv_version","alias_value":"1810.11982v1","created_at":"2026-05-18T00:02:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.11982","created_at":"2026-05-18T00:02:06Z"},{"alias_kind":"pith_short_12","alias_value":"I5XPCBKA7Z7I","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_16","alias_value":"I5XPCBKA7Z7IQ6XK","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_8","alias_value":"I5XPCBKA","created_at":"2026-05-18T12:32:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:I5XPCBKA7Z7IQ6XKMXB6J2K7Q5","target":"record","payload":{"canonical_record":{"source":{"id":"1810.11982","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-10-29T07:33:31Z","cross_cats_sorted":[],"title_canon_sha256":"036945df4f32bf5cd730c6f889b189df41bd0302871411d3ce491628e2bd6c43","abstract_canon_sha256":"5be337f02d6341bf3a2eeeac16c2418a4ce0b22a327855001d9387ad319cc227"},"schema_version":"1.0"},"canonical_sha256":"476ef10540fe7e887aea65c3e4e95f87682bf937e1c23078a0e7458afeb962ac","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:02:06.786878Z","signature_b64":"fTqeNJzfdZWxyUZItdAnAJ/f7vPa1IxY/ZX7fo+s0MJeSyLZLeGLELGD1R32mm0DNmjsgC+k86eN5ugNofxtBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"476ef10540fe7e887aea65c3e4e95f87682bf937e1c23078a0e7458afeb962ac","last_reissued_at":"2026-05-18T00:02:06.786206Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:02:06.786206Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1810.11982","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-18T00:02:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AAcxMxiSMcF9DDS6v9MLnsewJNRlXu2feldiyBia9mHezabhk1xhRTb6smlVZTTfCtmqfGjbDJQQd4ut9O9SDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-04T01:59:38.577463Z"},"content_sha256":"c8424afa68a2c3920c940d64118392b1181ca6cca5d702ad051c6d52f0fb1aae","schema_version":"1.0","event_id":"sha256:c8424afa68a2c3920c940d64118392b1181ca6cca5d702ad051c6d52f0fb1aae"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:I5XPCBKA7Z7IQ6XKMXB6J2K7Q5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On chordal phylogeny graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Soogang Eoh, Suh-Ryung Kim","submitted_at":"2018-10-29T07:33:31Z","abstract_excerpt":"An acyclic digraph each vertex of which has indegree at most $i$ and outdegree at most $j$ is called an $(i, j)$ digraph for some positive integers $i$ and $j$. Lee {\\it et al.} (2017) studied the phylogeny graphs of $(2, 2)$ digraphs and gave sufficient conditions and necessary conditions for $(2, 2)$ digraphs having chordal phylogeny graphs. Their work was motivated by problems related to evidence propagation in a Bayesian network for which it is useful to know which acyclic digraphs have their moral graphs being chordal (phylogeny graphs are called moral graphs in Bayesian network theory).\n"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.11982","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-18T00:02:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wb1653M1lOVMfa1PoY236RXBgqkZ/Mvl+vH1+4sH6CJ7YVoS64nRKXNKg5cRKuRZ/yc2+pCrQhJJ5MRCD62ABg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-04T01:59:38.578063Z"},"content_sha256":"9a99ca1e21993ff7b5119f4bef577ae919d42a84b1c9dd825501b920af78e505","schema_version":"1.0","event_id":"sha256:9a99ca1e21993ff7b5119f4bef577ae919d42a84b1c9dd825501b920af78e505"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/I5XPCBKA7Z7IQ6XKMXB6J2K7Q5/bundle.json","state_url":"https://pith.science/pith/I5XPCBKA7Z7IQ6XKMXB6J2K7Q5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/I5XPCBKA7Z7IQ6XKMXB6J2K7Q5/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-07-04T01:59:38Z","links":{"resolver":"https://pith.science/pith/I5XPCBKA7Z7IQ6XKMXB6J2K7Q5","bundle":"https://pith.science/pith/I5XPCBKA7Z7IQ6XKMXB6J2K7Q5/bundle.json","state":"https://pith.science/pith/I5XPCBKA7Z7IQ6XKMXB6J2K7Q5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/I5XPCBKA7Z7IQ6XKMXB6J2K7Q5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:I5XPCBKA7Z7IQ6XKMXB6J2K7Q5","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":"5be337f02d6341bf3a2eeeac16c2418a4ce0b22a327855001d9387ad319cc227","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-10-29T07:33:31Z","title_canon_sha256":"036945df4f32bf5cd730c6f889b189df41bd0302871411d3ce491628e2bd6c43"},"schema_version":"1.0","source":{"id":"1810.11982","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.11982","created_at":"2026-05-18T00:02:06Z"},{"alias_kind":"arxiv_version","alias_value":"1810.11982v1","created_at":"2026-05-18T00:02:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.11982","created_at":"2026-05-18T00:02:06Z"},{"alias_kind":"pith_short_12","alias_value":"I5XPCBKA7Z7I","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_16","alias_value":"I5XPCBKA7Z7IQ6XK","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_8","alias_value":"I5XPCBKA","created_at":"2026-05-18T12:32:28Z"}],"graph_snapshots":[{"event_id":"sha256:9a99ca1e21993ff7b5119f4bef577ae919d42a84b1c9dd825501b920af78e505","target":"graph","created_at":"2026-05-18T00:02:06Z","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":"An acyclic digraph each vertex of which has indegree at most $i$ and outdegree at most $j$ is called an $(i, j)$ digraph for some positive integers $i$ and $j$. Lee {\\it et al.} (2017) studied the phylogeny graphs of $(2, 2)$ digraphs and gave sufficient conditions and necessary conditions for $(2, 2)$ digraphs having chordal phylogeny graphs. Their work was motivated by problems related to evidence propagation in a Bayesian network for which it is useful to know which acyclic digraphs have their moral graphs being chordal (phylogeny graphs are called moral graphs in Bayesian network theory).\n","authors_text":"Soogang Eoh, Suh-Ryung Kim","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-10-29T07:33:31Z","title":"On chordal phylogeny graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.11982","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:c8424afa68a2c3920c940d64118392b1181ca6cca5d702ad051c6d52f0fb1aae","target":"record","created_at":"2026-05-18T00:02:06Z","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":"5be337f02d6341bf3a2eeeac16c2418a4ce0b22a327855001d9387ad319cc227","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-10-29T07:33:31Z","title_canon_sha256":"036945df4f32bf5cd730c6f889b189df41bd0302871411d3ce491628e2bd6c43"},"schema_version":"1.0","source":{"id":"1810.11982","kind":"arxiv","version":1}},"canonical_sha256":"476ef10540fe7e887aea65c3e4e95f87682bf937e1c23078a0e7458afeb962ac","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"476ef10540fe7e887aea65c3e4e95f87682bf937e1c23078a0e7458afeb962ac","first_computed_at":"2026-05-18T00:02:06.786206Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:02:06.786206Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fTqeNJzfdZWxyUZItdAnAJ/f7vPa1IxY/ZX7fo+s0MJeSyLZLeGLELGD1R32mm0DNmjsgC+k86eN5ugNofxtBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:02:06.786878Z","signed_message":"canonical_sha256_bytes"},"source_id":"1810.11982","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c8424afa68a2c3920c940d64118392b1181ca6cca5d702ad051c6d52f0fb1aae","sha256:9a99ca1e21993ff7b5119f4bef577ae919d42a84b1c9dd825501b920af78e505"],"state_sha256":"9391424972cd3076308bb0c179c752d53e5008bd392a02f45d33f96d067a4dc8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"emLVii1BkQCbDnXeUWeaXSrVoNdczjCGyd9QQowMu7+uwyyZKTxIK/8qfvktbh8tBukP8mb0mH4QgvfSrO8TDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-04T01:59:38.581918Z","bundle_sha256":"107deb87063f334ccc05d971b840c6e2ec7cec1e15ab415e7925a447fa21e52c"}}