{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:JRMWSYUAFRRSF3PHBEO5AGZCXI","short_pith_number":"pith:JRMWSYUA","schema_version":"1.0","canonical_sha256":"4c596962802c6322ede7091dd01b22ba242d07f5c1d1c9f100cd3bcab7880262","source":{"kind":"arxiv","id":"1409.7535","version":2},"attestation_state":"computed","paper":{"title":"The m-Degenerate Chromatic Number of a Digraph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Noah Golowich","submitted_at":"2014-09-26T11:19:09Z","abstract_excerpt":"The digraph chromatic number of a directed graph $D$, denoted $\\chi_A(D)$, is the minimum positive integer $k$ such that there exists a partition of the vertices of $D$ into $k$ disjoint sets, each of which induces an acyclic subgraph. For any $m \\geq 1$, a digraph is weakly $m$-degenerate if each of its induced subgraphs has a vertex of in-degree or out-degree less than $m$. We introduce a generalization of the digraph chromatic number, namely $\\chi_m(D)$, which is the minimum number of sets into which the vertices of a digraph $D$ can be partitioned so that each set induces a weakly $m$-dege"},"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":"1409.7535","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-09-26T11:19:09Z","cross_cats_sorted":[],"title_canon_sha256":"15a00cb06f1907b2a89c373bf186278f27bd003c00b9c442715848d70d70cbc8","abstract_canon_sha256":"b368fcdac6a279d56fcd81747fda453954ca8b1b0f0e566bc2eabb96bcb52598"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:59:18.355816Z","signature_b64":"4544XBQi0f1sb3f5OwnBhMEn7OHJp2KjhLwxz786BG4DAUNI+D7/dRi080j22d+IpQ8E08t6hrVHM0Ng4v9QAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4c596962802c6322ede7091dd01b22ba242d07f5c1d1c9f100cd3bcab7880262","last_reissued_at":"2026-05-17T23:59:18.355421Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:59:18.355421Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The m-Degenerate Chromatic Number of a Digraph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Noah Golowich","submitted_at":"2014-09-26T11:19:09Z","abstract_excerpt":"The digraph chromatic number of a directed graph $D$, denoted $\\chi_A(D)$, is the minimum positive integer $k$ such that there exists a partition of the vertices of $D$ into $k$ disjoint sets, each of which induces an acyclic subgraph. For any $m \\geq 1$, a digraph is weakly $m$-degenerate if each of its induced subgraphs has a vertex of in-degree or out-degree less than $m$. We introduce a generalization of the digraph chromatic number, namely $\\chi_m(D)$, which is the minimum number of sets into which the vertices of a digraph $D$ can be partitioned so that each set induces a weakly $m$-dege"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.7535","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":"1409.7535","created_at":"2026-05-17T23:59:18.355481+00:00"},{"alias_kind":"arxiv_version","alias_value":"1409.7535v2","created_at":"2026-05-17T23:59:18.355481+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.7535","created_at":"2026-05-17T23:59:18.355481+00:00"},{"alias_kind":"pith_short_12","alias_value":"JRMWSYUAFRRS","created_at":"2026-05-18T12:28:35.611951+00:00"},{"alias_kind":"pith_short_16","alias_value":"JRMWSYUAFRRSF3PH","created_at":"2026-05-18T12:28:35.611951+00:00"},{"alias_kind":"pith_short_8","alias_value":"JRMWSYUA","created_at":"2026-05-18T12:28:35.611951+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/JRMWSYUAFRRSF3PHBEO5AGZCXI","json":"https://pith.science/pith/JRMWSYUAFRRSF3PHBEO5AGZCXI.json","graph_json":"https://pith.science/api/pith-number/JRMWSYUAFRRSF3PHBEO5AGZCXI/graph.json","events_json":"https://pith.science/api/pith-number/JRMWSYUAFRRSF3PHBEO5AGZCXI/events.json","paper":"https://pith.science/paper/JRMWSYUA"},"agent_actions":{"view_html":"https://pith.science/pith/JRMWSYUAFRRSF3PHBEO5AGZCXI","download_json":"https://pith.science/pith/JRMWSYUAFRRSF3PHBEO5AGZCXI.json","view_paper":"https://pith.science/paper/JRMWSYUA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1409.7535&json=true","fetch_graph":"https://pith.science/api/pith-number/JRMWSYUAFRRSF3PHBEO5AGZCXI/graph.json","fetch_events":"https://pith.science/api/pith-number/JRMWSYUAFRRSF3PHBEO5AGZCXI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JRMWSYUAFRRSF3PHBEO5AGZCXI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JRMWSYUAFRRSF3PHBEO5AGZCXI/action/storage_attestation","attest_author":"https://pith.science/pith/JRMWSYUAFRRSF3PHBEO5AGZCXI/action/author_attestation","sign_citation":"https://pith.science/pith/JRMWSYUAFRRSF3PHBEO5AGZCXI/action/citation_signature","submit_replication":"https://pith.science/pith/JRMWSYUAFRRSF3PHBEO5AGZCXI/action/replication_record"}},"created_at":"2026-05-17T23:59:18.355481+00:00","updated_at":"2026-05-17T23:59:18.355481+00:00"}