{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:QDXX5SIUAGMI7UMAEPGXBQRHED","short_pith_number":"pith:QDXX5SIU","schema_version":"1.0","canonical_sha256":"80ef7ec91401988fd18023cd70c22720d49f560c16842dc646ff16ccd0978b8a","source":{"kind":"arxiv","id":"1611.00246","version":1},"attestation_state":"computed","paper":{"title":"On the phylogeny graphs of degree-bounded digraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jihoon Choi, Seung Chul Lee, Suh-Ryung Kim, Yoshio Sano","submitted_at":"2016-11-01T14:37:57Z","abstract_excerpt":"Hefner [K. A. S. Hefner, K. F. Jones, S. -R. Kim, R. J. Lundgren and F. S. Roberts: $(i,j)$ competition graphs, Discrete Applied Mathematics, 32, (1991) 241-262] characterized acyclic digraphs each vertex of which has inderee and outdegree at most two and whose competition graphs are interval. They called acyclic digraphs each vertex of which has inderee and outdegree at most two $(2,2)$ digraphs. In this paper, we study the phylogeny graphs of $(2,2)$ digraphs. Especially, we give a sufficient condition and necessary conditions for $(2,2)$ digraphs having chordal phylogeny graphs. Phylogeny g"},"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":"1611.00246","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-11-01T14:37:57Z","cross_cats_sorted":[],"title_canon_sha256":"7a1aed60d88b7f061164f71b027274c1ed75d394ebb1da73bbdb2d7caebdef7a","abstract_canon_sha256":"a52c55845fb7688070698e5484d0a5401082b95126a28a5ca757916ae6b5d090"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:00:41.194368Z","signature_b64":"6Qo+Fj9L2+9inJekt/pBV8Pt3KcL9QcUmpF6O9hN02WMBa+kMkqeuAeDYy3J7M83wro+E3kwQI1vNypMhBUIBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"80ef7ec91401988fd18023cd70c22720d49f560c16842dc646ff16ccd0978b8a","last_reissued_at":"2026-05-18T01:00:41.193945Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:00:41.193945Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the phylogeny graphs of degree-bounded digraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jihoon Choi, Seung Chul Lee, Suh-Ryung Kim, Yoshio Sano","submitted_at":"2016-11-01T14:37:57Z","abstract_excerpt":"Hefner [K. A. S. Hefner, K. F. Jones, S. -R. Kim, R. J. Lundgren and F. S. Roberts: $(i,j)$ competition graphs, Discrete Applied Mathematics, 32, (1991) 241-262] characterized acyclic digraphs each vertex of which has inderee and outdegree at most two and whose competition graphs are interval. They called acyclic digraphs each vertex of which has inderee and outdegree at most two $(2,2)$ digraphs. In this paper, we study the phylogeny graphs of $(2,2)$ digraphs. Especially, we give a sufficient condition and necessary conditions for $(2,2)$ digraphs having chordal phylogeny graphs. Phylogeny g"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.00246","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":"1611.00246","created_at":"2026-05-18T01:00:41.194006+00:00"},{"alias_kind":"arxiv_version","alias_value":"1611.00246v1","created_at":"2026-05-18T01:00:41.194006+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.00246","created_at":"2026-05-18T01:00:41.194006+00:00"},{"alias_kind":"pith_short_12","alias_value":"QDXX5SIUAGMI","created_at":"2026-05-18T12:30:39.010887+00:00"},{"alias_kind":"pith_short_16","alias_value":"QDXX5SIUAGMI7UMA","created_at":"2026-05-18T12:30:39.010887+00:00"},{"alias_kind":"pith_short_8","alias_value":"QDXX5SIU","created_at":"2026-05-18T12:30:39.010887+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/QDXX5SIUAGMI7UMAEPGXBQRHED","json":"https://pith.science/pith/QDXX5SIUAGMI7UMAEPGXBQRHED.json","graph_json":"https://pith.science/api/pith-number/QDXX5SIUAGMI7UMAEPGXBQRHED/graph.json","events_json":"https://pith.science/api/pith-number/QDXX5SIUAGMI7UMAEPGXBQRHED/events.json","paper":"https://pith.science/paper/QDXX5SIU"},"agent_actions":{"view_html":"https://pith.science/pith/QDXX5SIUAGMI7UMAEPGXBQRHED","download_json":"https://pith.science/pith/QDXX5SIUAGMI7UMAEPGXBQRHED.json","view_paper":"https://pith.science/paper/QDXX5SIU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1611.00246&json=true","fetch_graph":"https://pith.science/api/pith-number/QDXX5SIUAGMI7UMAEPGXBQRHED/graph.json","fetch_events":"https://pith.science/api/pith-number/QDXX5SIUAGMI7UMAEPGXBQRHED/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QDXX5SIUAGMI7UMAEPGXBQRHED/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QDXX5SIUAGMI7UMAEPGXBQRHED/action/storage_attestation","attest_author":"https://pith.science/pith/QDXX5SIUAGMI7UMAEPGXBQRHED/action/author_attestation","sign_citation":"https://pith.science/pith/QDXX5SIUAGMI7UMAEPGXBQRHED/action/citation_signature","submit_replication":"https://pith.science/pith/QDXX5SIUAGMI7UMAEPGXBQRHED/action/replication_record"}},"created_at":"2026-05-18T01:00:41.194006+00:00","updated_at":"2026-05-18T01:00:41.194006+00:00"}