{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:QDXX5SIUAGMI7UMAEPGXBQRHED","short_pith_number":"pith:QDXX5SIU","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"},"canonical_sha256":"80ef7ec91401988fd18023cd70c22720d49f560c16842dc646ff16ccd0978b8a","source":{"kind":"arxiv","id":"1611.00246","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.00246","created_at":"2026-05-18T01:00:41Z"},{"alias_kind":"arxiv_version","alias_value":"1611.00246v1","created_at":"2026-05-18T01:00:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.00246","created_at":"2026-05-18T01:00:41Z"},{"alias_kind":"pith_short_12","alias_value":"QDXX5SIUAGMI","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_16","alias_value":"QDXX5SIUAGMI7UMA","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_8","alias_value":"QDXX5SIU","created_at":"2026-05-18T12:30:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:QDXX5SIUAGMI7UMAEPGXBQRHED","target":"record","payload":{"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"},"canonical_sha256":"80ef7ec91401988fd18023cd70c22720d49f560c16842dc646ff16ccd0978b8a","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"},"source_kind":"arxiv","source_id":"1611.00246","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-18T01:00:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ANglD9lteT6cD7cZn95lNP5NcBd4oF/3i2fYB3XE5h0MEmOowfkeuMc6M8k4iMbijad7+UBV0jOhNAG/rE70Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-03T21:14:36.366927Z"},"content_sha256":"37a28463603061ae89cee07d4aea45adbc32522e2d0a564cb30ed3bf5e2c9ddf","schema_version":"1.0","event_id":"sha256:37a28463603061ae89cee07d4aea45adbc32522e2d0a564cb30ed3bf5e2c9ddf"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:QDXX5SIUAGMI7UMAEPGXBQRHED","target":"graph","payload":{"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"},"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-18T01:00:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"a09MVnIBAlgItFWawl53G3cHfFiHx24rbI6iqd80SL02IOLNjtr+F4dz9wWDc7j9oTzlZEqreDqnuvQr1hUkBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-03T21:14:36.367258Z"},"content_sha256":"a74bda15a8c54d292ed3e6bca618ae0ad4500e0cab6155b65169c9d4cad2744e","schema_version":"1.0","event_id":"sha256:a74bda15a8c54d292ed3e6bca618ae0ad4500e0cab6155b65169c9d4cad2744e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QDXX5SIUAGMI7UMAEPGXBQRHED/bundle.json","state_url":"https://pith.science/pith/QDXX5SIUAGMI7UMAEPGXBQRHED/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QDXX5SIUAGMI7UMAEPGXBQRHED/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-03T21:14:36Z","links":{"resolver":"https://pith.science/pith/QDXX5SIUAGMI7UMAEPGXBQRHED","bundle":"https://pith.science/pith/QDXX5SIUAGMI7UMAEPGXBQRHED/bundle.json","state":"https://pith.science/pith/QDXX5SIUAGMI7UMAEPGXBQRHED/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QDXX5SIUAGMI7UMAEPGXBQRHED/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:QDXX5SIUAGMI7UMAEPGXBQRHED","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":"a52c55845fb7688070698e5484d0a5401082b95126a28a5ca757916ae6b5d090","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-11-01T14:37:57Z","title_canon_sha256":"7a1aed60d88b7f061164f71b027274c1ed75d394ebb1da73bbdb2d7caebdef7a"},"schema_version":"1.0","source":{"id":"1611.00246","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.00246","created_at":"2026-05-18T01:00:41Z"},{"alias_kind":"arxiv_version","alias_value":"1611.00246v1","created_at":"2026-05-18T01:00:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.00246","created_at":"2026-05-18T01:00:41Z"},{"alias_kind":"pith_short_12","alias_value":"QDXX5SIUAGMI","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_16","alias_value":"QDXX5SIUAGMI7UMA","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_8","alias_value":"QDXX5SIU","created_at":"2026-05-18T12:30:39Z"}],"graph_snapshots":[{"event_id":"sha256:a74bda15a8c54d292ed3e6bca618ae0ad4500e0cab6155b65169c9d4cad2744e","target":"graph","created_at":"2026-05-18T01:00:41Z","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":"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","authors_text":"Jihoon Choi, Seung Chul Lee, Suh-Ryung Kim, Yoshio Sano","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-11-01T14:37:57Z","title":"On the phylogeny graphs of degree-bounded digraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.00246","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:37a28463603061ae89cee07d4aea45adbc32522e2d0a564cb30ed3bf5e2c9ddf","target":"record","created_at":"2026-05-18T01:00:41Z","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":"a52c55845fb7688070698e5484d0a5401082b95126a28a5ca757916ae6b5d090","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-11-01T14:37:57Z","title_canon_sha256":"7a1aed60d88b7f061164f71b027274c1ed75d394ebb1da73bbdb2d7caebdef7a"},"schema_version":"1.0","source":{"id":"1611.00246","kind":"arxiv","version":1}},"canonical_sha256":"80ef7ec91401988fd18023cd70c22720d49f560c16842dc646ff16ccd0978b8a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"80ef7ec91401988fd18023cd70c22720d49f560c16842dc646ff16ccd0978b8a","first_computed_at":"2026-05-18T01:00:41.193945Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:00:41.193945Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6Qo+Fj9L2+9inJekt/pBV8Pt3KcL9QcUmpF6O9hN02WMBa+kMkqeuAeDYy3J7M83wro+E3kwQI1vNypMhBUIBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:00:41.194368Z","signed_message":"canonical_sha256_bytes"},"source_id":"1611.00246","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:37a28463603061ae89cee07d4aea45adbc32522e2d0a564cb30ed3bf5e2c9ddf","sha256:a74bda15a8c54d292ed3e6bca618ae0ad4500e0cab6155b65169c9d4cad2744e"],"state_sha256":"f883c1e5c4e65914501725d86ce6bc636a9aa8d0833e0159de968ae70ebe5f35"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RQJT0gk6M6d4c6gQvR3JWQ3hEACoNw6SC3eRUuRTGjKLSkRXZyhxJcKPrbMGhcWXYjrHSJPgfaqByD6LicbnAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-03T21:14:36.369484Z","bundle_sha256":"c77dadfa8c670f785d4afd4b4bd91e2fd28383c83182a9ef508ca71da7f9e280"}}