{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:YSIBB7JSPIOIROH67QALLHJND7","short_pith_number":"pith:YSIBB7JS","schema_version":"1.0","canonical_sha256":"c49010fd327a1c88b8fefc00b59d2d1fd5889958f395274f9c0ecf6e52844f23","source":{"kind":"arxiv","id":"1308.5170","version":2},"attestation_state":"computed","paper":{"title":"Forbidden Directed Minors and Kelly-width","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Qiuyi Zhang, Shiva Kintali","submitted_at":"2013-08-23T16:19:58Z","abstract_excerpt":"Partial 1-trees are undirected graphs of treewidth at most one. Similarly, partial 1-DAGs are directed graphs of KellyWidth at most two. It is well-known that an undirected graph is a partial 1-tree if and only if it has no K_3 minor. In this paper, we generalize this characterization to partial 1-DAGs. We show that partial 1-DAGs are characterized by three forbidden directed minors, K_3, N_4 and M_5."},"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":"1308.5170","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-08-23T16:19:58Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"e902dc5996de22c779b2822027c92c796971c763440b151cc7cf933320fd02e0","abstract_canon_sha256":"c18173e96d18feabc2e380ff2bc33a165a6c214062f57ffd0f799ad16a62c3d9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:02:34.695356Z","signature_b64":"btGTWP1bqQKmd4B40DtW0BT8WMKdsc3ZSYe2gsS1FQWf4X62zs4g77lEAdRW51e31yViacedOg0yH+XOff+UBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c49010fd327a1c88b8fefc00b59d2d1fd5889958f395274f9c0ecf6e52844f23","last_reissued_at":"2026-05-18T03:02:34.694767Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:02:34.694767Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Forbidden Directed Minors and Kelly-width","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Qiuyi Zhang, Shiva Kintali","submitted_at":"2013-08-23T16:19:58Z","abstract_excerpt":"Partial 1-trees are undirected graphs of treewidth at most one. Similarly, partial 1-DAGs are directed graphs of KellyWidth at most two. It is well-known that an undirected graph is a partial 1-tree if and only if it has no K_3 minor. In this paper, we generalize this characterization to partial 1-DAGs. We show that partial 1-DAGs are characterized by three forbidden directed minors, K_3, N_4 and M_5."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.5170","kind":"arxiv","version":2},"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":"1308.5170","created_at":"2026-05-18T03:02:34.694862+00:00"},{"alias_kind":"arxiv_version","alias_value":"1308.5170v2","created_at":"2026-05-18T03:02:34.694862+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.5170","created_at":"2026-05-18T03:02:34.694862+00:00"},{"alias_kind":"pith_short_12","alias_value":"YSIBB7JSPIOI","created_at":"2026-05-18T12:28:09.283467+00:00"},{"alias_kind":"pith_short_16","alias_value":"YSIBB7JSPIOIROH6","created_at":"2026-05-18T12:28:09.283467+00:00"},{"alias_kind":"pith_short_8","alias_value":"YSIBB7JS","created_at":"2026-05-18T12:28:09.283467+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/YSIBB7JSPIOIROH67QALLHJND7","json":"https://pith.science/pith/YSIBB7JSPIOIROH67QALLHJND7.json","graph_json":"https://pith.science/api/pith-number/YSIBB7JSPIOIROH67QALLHJND7/graph.json","events_json":"https://pith.science/api/pith-number/YSIBB7JSPIOIROH67QALLHJND7/events.json","paper":"https://pith.science/paper/YSIBB7JS"},"agent_actions":{"view_html":"https://pith.science/pith/YSIBB7JSPIOIROH67QALLHJND7","download_json":"https://pith.science/pith/YSIBB7JSPIOIROH67QALLHJND7.json","view_paper":"https://pith.science/paper/YSIBB7JS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1308.5170&json=true","fetch_graph":"https://pith.science/api/pith-number/YSIBB7JSPIOIROH67QALLHJND7/graph.json","fetch_events":"https://pith.science/api/pith-number/YSIBB7JSPIOIROH67QALLHJND7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YSIBB7JSPIOIROH67QALLHJND7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YSIBB7JSPIOIROH67QALLHJND7/action/storage_attestation","attest_author":"https://pith.science/pith/YSIBB7JSPIOIROH67QALLHJND7/action/author_attestation","sign_citation":"https://pith.science/pith/YSIBB7JSPIOIROH67QALLHJND7/action/citation_signature","submit_replication":"https://pith.science/pith/YSIBB7JSPIOIROH67QALLHJND7/action/replication_record"}},"created_at":"2026-05-18T03:02:34.694862+00:00","updated_at":"2026-05-18T03:02:34.694862+00:00"}