{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:YL6GMY7OKD55OQIPFYWMN5ZLLO","short_pith_number":"pith:YL6GMY7O","canonical_record":{"source":{"id":"1410.1219","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-10-05T22:47:53Z","cross_cats_sorted":[],"title_canon_sha256":"a34263a214823e7a72ae5094cadb92bd012f1c34a98dee864f8c28c890fb35eb","abstract_canon_sha256":"e24f12aca07ee57a5d50a9a2dee16946cb0d0c8c327b03bf6561dc4926d68044"},"schema_version":"1.0"},"canonical_sha256":"c2fc6663ee50fbd7410f2e2cc6f72b5bb20c206a097be44cfd5a0404ade9f0fa","source":{"kind":"arxiv","id":"1410.1219","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.1219","created_at":"2026-05-18T00:55:58Z"},{"alias_kind":"arxiv_version","alias_value":"1410.1219v2","created_at":"2026-05-18T00:55:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.1219","created_at":"2026-05-18T00:55:58Z"},{"alias_kind":"pith_short_12","alias_value":"YL6GMY7OKD55","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_16","alias_value":"YL6GMY7OKD55OQIP","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_8","alias_value":"YL6GMY7O","created_at":"2026-05-18T12:28:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:YL6GMY7OKD55OQIPFYWMN5ZLLO","target":"record","payload":{"canonical_record":{"source":{"id":"1410.1219","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-10-05T22:47:53Z","cross_cats_sorted":[],"title_canon_sha256":"a34263a214823e7a72ae5094cadb92bd012f1c34a98dee864f8c28c890fb35eb","abstract_canon_sha256":"e24f12aca07ee57a5d50a9a2dee16946cb0d0c8c327b03bf6561dc4926d68044"},"schema_version":"1.0"},"canonical_sha256":"c2fc6663ee50fbd7410f2e2cc6f72b5bb20c206a097be44cfd5a0404ade9f0fa","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:55:58.680395Z","signature_b64":"TYVx/hbh3sVEK8J58smkJuHNMIYiH6FIJvliR6MsURsYibz/Iz2EZ4pcZKozFY42Uqa1L8QDO4/1pCWakq86CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c2fc6663ee50fbd7410f2e2cc6f72b5bb20c206a097be44cfd5a0404ade9f0fa","last_reissued_at":"2026-05-18T00:55:58.679700Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:55:58.679700Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1410.1219","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-18T00:55:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bPWnHTXG76l66QWr8x5Thnqwslj82jVfeDrT3Kbbpg3QBn9xqhAld9Uoj8guYPKiPiRIohbMLSC4scga7J+DCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T18:46:11.188983Z"},"content_sha256":"e55b20985576c41562f53608071431ecbd57da07f7c5367fb96704c2840580a8","schema_version":"1.0","event_id":"sha256:e55b20985576c41562f53608071431ecbd57da07f7c5367fb96704c2840580a8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:YL6GMY7OKD55OQIPFYWMN5ZLLO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Brooks Type Results for Conflict-Free Colorings and {a, b}-factors in graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jonathan Rollin, Maria Axenovich","submitted_at":"2014-10-05T22:47:53Z","abstract_excerpt":"A vertex-coloring of a hypergraph is conflict-free, if each edge contains a vertex whose color is not repeated on any other vertex of that edge. Let $f(r, \\Delta)$ be the smallest integer $k$ such that each $r$-uniform hypergraph of maximum vertex degree $\\Delta$ has a conflict-free coloring with at most $k$ colors. As shown by Tardos and Pach, similarly to a classical Brooks' type theorem for hypergraphs, $f(r, \\Delta)\\leq \\Delta+1$. Compared to Brooks' theorem, according to which there is only a couple of graphs/hypergraphs that attain the $\\Delta+1$ bound, we show that there are several inf"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.1219","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-18T00:55:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VjVDegnluz1IcXZKRY6f3ETrVMwYOT2ZtLu5VzPiGZCidtpvNcmNNEUvCsB1I3nAQRBrLq3Fhn70Af6oSLKVAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T18:46:11.189339Z"},"content_sha256":"646ceaa436cdfca42712070d0fe543ebfc324a4f4a34a4eef08254098b1b4ddb","schema_version":"1.0","event_id":"sha256:646ceaa436cdfca42712070d0fe543ebfc324a4f4a34a4eef08254098b1b4ddb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YL6GMY7OKD55OQIPFYWMN5ZLLO/bundle.json","state_url":"https://pith.science/pith/YL6GMY7OKD55OQIPFYWMN5ZLLO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YL6GMY7OKD55OQIPFYWMN5ZLLO/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-19T18:46:11Z","links":{"resolver":"https://pith.science/pith/YL6GMY7OKD55OQIPFYWMN5ZLLO","bundle":"https://pith.science/pith/YL6GMY7OKD55OQIPFYWMN5ZLLO/bundle.json","state":"https://pith.science/pith/YL6GMY7OKD55OQIPFYWMN5ZLLO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YL6GMY7OKD55OQIPFYWMN5ZLLO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:YL6GMY7OKD55OQIPFYWMN5ZLLO","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":"e24f12aca07ee57a5d50a9a2dee16946cb0d0c8c327b03bf6561dc4926d68044","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-10-05T22:47:53Z","title_canon_sha256":"a34263a214823e7a72ae5094cadb92bd012f1c34a98dee864f8c28c890fb35eb"},"schema_version":"1.0","source":{"id":"1410.1219","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.1219","created_at":"2026-05-18T00:55:58Z"},{"alias_kind":"arxiv_version","alias_value":"1410.1219v2","created_at":"2026-05-18T00:55:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.1219","created_at":"2026-05-18T00:55:58Z"},{"alias_kind":"pith_short_12","alias_value":"YL6GMY7OKD55","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_16","alias_value":"YL6GMY7OKD55OQIP","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_8","alias_value":"YL6GMY7O","created_at":"2026-05-18T12:28:57Z"}],"graph_snapshots":[{"event_id":"sha256:646ceaa436cdfca42712070d0fe543ebfc324a4f4a34a4eef08254098b1b4ddb","target":"graph","created_at":"2026-05-18T00:55:58Z","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":"A vertex-coloring of a hypergraph is conflict-free, if each edge contains a vertex whose color is not repeated on any other vertex of that edge. Let $f(r, \\Delta)$ be the smallest integer $k$ such that each $r$-uniform hypergraph of maximum vertex degree $\\Delta$ has a conflict-free coloring with at most $k$ colors. As shown by Tardos and Pach, similarly to a classical Brooks' type theorem for hypergraphs, $f(r, \\Delta)\\leq \\Delta+1$. Compared to Brooks' theorem, according to which there is only a couple of graphs/hypergraphs that attain the $\\Delta+1$ bound, we show that there are several inf","authors_text":"Jonathan Rollin, Maria Axenovich","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-10-05T22:47:53Z","title":"Brooks Type Results for Conflict-Free Colorings and {a, b}-factors in graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.1219","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:e55b20985576c41562f53608071431ecbd57da07f7c5367fb96704c2840580a8","target":"record","created_at":"2026-05-18T00:55:58Z","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":"e24f12aca07ee57a5d50a9a2dee16946cb0d0c8c327b03bf6561dc4926d68044","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-10-05T22:47:53Z","title_canon_sha256":"a34263a214823e7a72ae5094cadb92bd012f1c34a98dee864f8c28c890fb35eb"},"schema_version":"1.0","source":{"id":"1410.1219","kind":"arxiv","version":2}},"canonical_sha256":"c2fc6663ee50fbd7410f2e2cc6f72b5bb20c206a097be44cfd5a0404ade9f0fa","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c2fc6663ee50fbd7410f2e2cc6f72b5bb20c206a097be44cfd5a0404ade9f0fa","first_computed_at":"2026-05-18T00:55:58.679700Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:55:58.679700Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"TYVx/hbh3sVEK8J58smkJuHNMIYiH6FIJvliR6MsURsYibz/Iz2EZ4pcZKozFY42Uqa1L8QDO4/1pCWakq86CA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:55:58.680395Z","signed_message":"canonical_sha256_bytes"},"source_id":"1410.1219","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e55b20985576c41562f53608071431ecbd57da07f7c5367fb96704c2840580a8","sha256:646ceaa436cdfca42712070d0fe543ebfc324a4f4a34a4eef08254098b1b4ddb"],"state_sha256":"96dbaba414134d7e03a4db48e4152de2f557421fb87d4a3bf8ad5d295c0325c8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hF0h/328kYJO9um4wbq3tiftfMF/6K/Owz7EMNjDpR/1DgIHvd4UVQr0EgAsuUCb9YPB21K8O+NEQ9nynpcFDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-19T18:46:11.191468Z","bundle_sha256":"8ad3a504042ac6b7ecf7f84d9bf344adb73345c6d2685678e207f0f6a91d8bfa"}}