{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:JRMWSYUAFRRSF3PHBEO5AGZCXI","short_pith_number":"pith:JRMWSYUA","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"},"canonical_sha256":"4c596962802c6322ede7091dd01b22ba242d07f5c1d1c9f100cd3bcab7880262","source":{"kind":"arxiv","id":"1409.7535","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.7535","created_at":"2026-05-17T23:59:18Z"},{"alias_kind":"arxiv_version","alias_value":"1409.7535v2","created_at":"2026-05-17T23:59:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.7535","created_at":"2026-05-17T23:59:18Z"},{"alias_kind":"pith_short_12","alias_value":"JRMWSYUAFRRS","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_16","alias_value":"JRMWSYUAFRRSF3PH","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_8","alias_value":"JRMWSYUA","created_at":"2026-05-18T12:28:35Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:JRMWSYUAFRRSF3PHBEO5AGZCXI","target":"record","payload":{"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"},"canonical_sha256":"4c596962802c6322ede7091dd01b22ba242d07f5c1d1c9f100cd3bcab7880262","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"},"source_kind":"arxiv","source_id":"1409.7535","source_version":2,"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-17T23:59:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aQ7SMkHyPvUnTz5ZgOy+f7kJ99md5la7wM0/yQKxem+1xiSx42B13yvvH5v1olf57EsoVw3XHb48BDobl5ghAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T06:51:55.124198Z"},"content_sha256":"e4cd018400b63f3bb89654645d8f8d6b80cfabbc3a03e4fd019258b956576563","schema_version":"1.0","event_id":"sha256:e4cd018400b63f3bb89654645d8f8d6b80cfabbc3a03e4fd019258b956576563"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:JRMWSYUAFRRSF3PHBEO5AGZCXI","target":"graph","payload":{"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"},"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-17T23:59:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QnHuDEFTnCeddobNxL+2QcYN850hejDBxMo/Qu1QjmeGdxE91cxw3beazGG3Jum/89kpbhP4MHJhlFdxReLZBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T06:51:55.124932Z"},"content_sha256":"8f79edce514507c0c27a03e44a2860ed48c3aa082df2917c9e4a01a33cb53ba5","schema_version":"1.0","event_id":"sha256:8f79edce514507c0c27a03e44a2860ed48c3aa082df2917c9e4a01a33cb53ba5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JRMWSYUAFRRSF3PHBEO5AGZCXI/bundle.json","state_url":"https://pith.science/pith/JRMWSYUAFRRSF3PHBEO5AGZCXI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JRMWSYUAFRRSF3PHBEO5AGZCXI/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-05-26T06:51:55Z","links":{"resolver":"https://pith.science/pith/JRMWSYUAFRRSF3PHBEO5AGZCXI","bundle":"https://pith.science/pith/JRMWSYUAFRRSF3PHBEO5AGZCXI/bundle.json","state":"https://pith.science/pith/JRMWSYUAFRRSF3PHBEO5AGZCXI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JRMWSYUAFRRSF3PHBEO5AGZCXI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:JRMWSYUAFRRSF3PHBEO5AGZCXI","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":"b368fcdac6a279d56fcd81747fda453954ca8b1b0f0e566bc2eabb96bcb52598","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-09-26T11:19:09Z","title_canon_sha256":"15a00cb06f1907b2a89c373bf186278f27bd003c00b9c442715848d70d70cbc8"},"schema_version":"1.0","source":{"id":"1409.7535","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.7535","created_at":"2026-05-17T23:59:18Z"},{"alias_kind":"arxiv_version","alias_value":"1409.7535v2","created_at":"2026-05-17T23:59:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.7535","created_at":"2026-05-17T23:59:18Z"},{"alias_kind":"pith_short_12","alias_value":"JRMWSYUAFRRS","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_16","alias_value":"JRMWSYUAFRRSF3PH","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_8","alias_value":"JRMWSYUA","created_at":"2026-05-18T12:28:35Z"}],"graph_snapshots":[{"event_id":"sha256:8f79edce514507c0c27a03e44a2860ed48c3aa082df2917c9e4a01a33cb53ba5","target":"graph","created_at":"2026-05-17T23:59:18Z","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":"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","authors_text":"Noah Golowich","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-09-26T11:19:09Z","title":"The m-Degenerate Chromatic Number of a Digraph"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.7535","kind":"arxiv","version":2},"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:e4cd018400b63f3bb89654645d8f8d6b80cfabbc3a03e4fd019258b956576563","target":"record","created_at":"2026-05-17T23:59:18Z","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":"b368fcdac6a279d56fcd81747fda453954ca8b1b0f0e566bc2eabb96bcb52598","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-09-26T11:19:09Z","title_canon_sha256":"15a00cb06f1907b2a89c373bf186278f27bd003c00b9c442715848d70d70cbc8"},"schema_version":"1.0","source":{"id":"1409.7535","kind":"arxiv","version":2}},"canonical_sha256":"4c596962802c6322ede7091dd01b22ba242d07f5c1d1c9f100cd3bcab7880262","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4c596962802c6322ede7091dd01b22ba242d07f5c1d1c9f100cd3bcab7880262","first_computed_at":"2026-05-17T23:59:18.355421Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:59:18.355421Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4544XBQi0f1sb3f5OwnBhMEn7OHJp2KjhLwxz786BG4DAUNI+D7/dRi080j22d+IpQ8E08t6hrVHM0Ng4v9QAQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:59:18.355816Z","signed_message":"canonical_sha256_bytes"},"source_id":"1409.7535","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e4cd018400b63f3bb89654645d8f8d6b80cfabbc3a03e4fd019258b956576563","sha256:8f79edce514507c0c27a03e44a2860ed48c3aa082df2917c9e4a01a33cb53ba5"],"state_sha256":"372ef425c35a1bc426180e6909901890e360f61f39c46597911fbaae0bc9915a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"u4RSI5ofjhs46odw75VNaWqHPKQnRcBPQeSN+c0YGQNGgOF/n0997HbY1yBqBOcfU/Dj0uRhrfcoBpbAIinDAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T06:51:55.128574Z","bundle_sha256":"2cccd2e11637b8f3addc06f9cc301d3ae2186ffcc5b19d8ce2db12a6f7aa765e"}}