{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:I5XPCBKA7Z7IQ6XKMXB6J2K7Q5","short_pith_number":"pith:I5XPCBKA","schema_version":"1.0","canonical_sha256":"476ef10540fe7e887aea65c3e4e95f87682bf937e1c23078a0e7458afeb962ac","source":{"kind":"arxiv","id":"1810.11982","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1810.11982","created_at":"2026-05-18T00:02:06.786335+00:00"},{"alias_kind":"arxiv_version","alias_value":"1810.11982v1","created_at":"2026-05-18T00:02:06.786335+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.11982","created_at":"2026-05-18T00:02:06.786335+00:00"},{"alias_kind":"pith_short_12","alias_value":"I5XPCBKA7Z7I","created_at":"2026-05-18T12:32:28.185984+00:00"},{"alias_kind":"pith_short_16","alias_value":"I5XPCBKA7Z7IQ6XK","created_at":"2026-05-18T12:32:28.185984+00:00"},{"alias_kind":"pith_short_8","alias_value":"I5XPCBKA","created_at":"2026-05-18T12:32:28.185984+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/I5XPCBKA7Z7IQ6XKMXB6J2K7Q5","json":"https://pith.science/pith/I5XPCBKA7Z7IQ6XKMXB6J2K7Q5.json","graph_json":"https://pith.science/api/pith-number/I5XPCBKA7Z7IQ6XKMXB6J2K7Q5/graph.json","events_json":"https://pith.science/api/pith-number/I5XPCBKA7Z7IQ6XKMXB6J2K7Q5/events.json","paper":"https://pith.science/paper/I5XPCBKA"},"agent_actions":{"view_html":"https://pith.science/pith/I5XPCBKA7Z7IQ6XKMXB6J2K7Q5","download_json":"https://pith.science/pith/I5XPCBKA7Z7IQ6XKMXB6J2K7Q5.json","view_paper":"https://pith.science/paper/I5XPCBKA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1810.11982&json=true","fetch_graph":"https://pith.science/api/pith-number/I5XPCBKA7Z7IQ6XKMXB6J2K7Q5/graph.json","fetch_events":"https://pith.science/api/pith-number/I5XPCBKA7Z7IQ6XKMXB6J2K7Q5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/I5XPCBKA7Z7IQ6XKMXB6J2K7Q5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/I5XPCBKA7Z7IQ6XKMXB6J2K7Q5/action/storage_attestation","attest_author":"https://pith.science/pith/I5XPCBKA7Z7IQ6XKMXB6J2K7Q5/action/author_attestation","sign_citation":"https://pith.science/pith/I5XPCBKA7Z7IQ6XKMXB6J2K7Q5/action/citation_signature","submit_replication":"https://pith.science/pith/I5XPCBKA7Z7IQ6XKMXB6J2K7Q5/action/replication_record"}},"created_at":"2026-05-18T00:02:06.786335+00:00","updated_at":"2026-05-18T00:02:06.786335+00:00"}