{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:XNW6BH5SXXNEOHSQBVNHQECVA2","short_pith_number":"pith:XNW6BH5S","schema_version":"1.0","canonical_sha256":"bb6de09fb2bdda471e500d5a78105506be27c87d9c1b627c0d61b8d91ce2ff48","source":{"kind":"arxiv","id":"1109.4671","version":2},"attestation_state":"computed","paper":{"title":"Covering the edges of digraphs in $\\mathscr{D}(3,3)$ and $\\mathscr{D}(4,4)$ with directed cuts","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Binlong Li, Shenggui Zhang, Yandong Bai","submitted_at":"2011-09-21T23:25:06Z","abstract_excerpt":"For nonnegative integers $k$ and $l$, let $\\mathscr{D}(k,l)$ denote the family of digraphs in which every vertex has either indegree at most $k$ or outdegree at most $l$. In this paper we prove that the edges of every digraph in $\\mathscr{D}(3,3)$ and $\\mathscr{D}(4,4)$ can be covered by at most five directed cuts and present an example in $\\mathscr{D}(3,3)$ showing that this result is best possible."},"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":"1109.4671","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-09-21T23:25:06Z","cross_cats_sorted":[],"title_canon_sha256":"2cd6a244d52b4c5e88b840782d3310367e74cf93422677d63e5e2b31411d26ef","abstract_canon_sha256":"f9c643bc0406600ff6129617cea0a47ef36672b9590fc3e924f02dbcd8f07948"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:03:09.007760Z","signature_b64":"fz1GxlkIOtNuQxerJ4drqZuuMP8O21gMoQOnsZWJQz8qAlk/SIDReTbO5P1UpckqrBEAll0U2Y26tCSIaYjKAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bb6de09fb2bdda471e500d5a78105506be27c87d9c1b627c0d61b8d91ce2ff48","last_reissued_at":"2026-05-18T04:03:09.007084Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:03:09.007084Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Covering the edges of digraphs in $\\mathscr{D}(3,3)$ and $\\mathscr{D}(4,4)$ with directed cuts","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Binlong Li, Shenggui Zhang, Yandong Bai","submitted_at":"2011-09-21T23:25:06Z","abstract_excerpt":"For nonnegative integers $k$ and $l$, let $\\mathscr{D}(k,l)$ denote the family of digraphs in which every vertex has either indegree at most $k$ or outdegree at most $l$. In this paper we prove that the edges of every digraph in $\\mathscr{D}(3,3)$ and $\\mathscr{D}(4,4)$ can be covered by at most five directed cuts and present an example in $\\mathscr{D}(3,3)$ showing that this result is best possible."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.4671","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":"1109.4671","created_at":"2026-05-18T04:03:09.007170+00:00"},{"alias_kind":"arxiv_version","alias_value":"1109.4671v2","created_at":"2026-05-18T04:03:09.007170+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.4671","created_at":"2026-05-18T04:03:09.007170+00:00"},{"alias_kind":"pith_short_12","alias_value":"XNW6BH5SXXNE","created_at":"2026-05-18T12:26:47.523578+00:00"},{"alias_kind":"pith_short_16","alias_value":"XNW6BH5SXXNEOHSQ","created_at":"2026-05-18T12:26:47.523578+00:00"},{"alias_kind":"pith_short_8","alias_value":"XNW6BH5S","created_at":"2026-05-18T12:26:47.523578+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/XNW6BH5SXXNEOHSQBVNHQECVA2","json":"https://pith.science/pith/XNW6BH5SXXNEOHSQBVNHQECVA2.json","graph_json":"https://pith.science/api/pith-number/XNW6BH5SXXNEOHSQBVNHQECVA2/graph.json","events_json":"https://pith.science/api/pith-number/XNW6BH5SXXNEOHSQBVNHQECVA2/events.json","paper":"https://pith.science/paper/XNW6BH5S"},"agent_actions":{"view_html":"https://pith.science/pith/XNW6BH5SXXNEOHSQBVNHQECVA2","download_json":"https://pith.science/pith/XNW6BH5SXXNEOHSQBVNHQECVA2.json","view_paper":"https://pith.science/paper/XNW6BH5S","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1109.4671&json=true","fetch_graph":"https://pith.science/api/pith-number/XNW6BH5SXXNEOHSQBVNHQECVA2/graph.json","fetch_events":"https://pith.science/api/pith-number/XNW6BH5SXXNEOHSQBVNHQECVA2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XNW6BH5SXXNEOHSQBVNHQECVA2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XNW6BH5SXXNEOHSQBVNHQECVA2/action/storage_attestation","attest_author":"https://pith.science/pith/XNW6BH5SXXNEOHSQBVNHQECVA2/action/author_attestation","sign_citation":"https://pith.science/pith/XNW6BH5SXXNEOHSQBVNHQECVA2/action/citation_signature","submit_replication":"https://pith.science/pith/XNW6BH5SXXNEOHSQBVNHQECVA2/action/replication_record"}},"created_at":"2026-05-18T04:03:09.007170+00:00","updated_at":"2026-05-18T04:03:09.007170+00:00"}