{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:K3JKG77TSHDFYPDU7PL4TI7NRD","short_pith_number":"pith:K3JKG77T","canonical_record":{"source":{"id":"2504.12430","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-04-16T18:59:47Z","cross_cats_sorted":[],"title_canon_sha256":"b569d48f192da8e3cc4734cdd2e5d82c694e15b685ca537aaebccccdd848b424","abstract_canon_sha256":"2f7f2a9e2394f94258b2e9af1b9e8f6a3e19115b6dea05205889eabbaccda76b"},"schema_version":"1.0"},"canonical_sha256":"56d2a37ff391c65c3c74fbd7c9a3ed88c7d4ca348d58840ea059a5307b852e4b","source":{"kind":"arxiv","id":"2504.12430","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2504.12430","created_at":"2026-06-09T01:05:06Z"},{"alias_kind":"arxiv_version","alias_value":"2504.12430v2","created_at":"2026-06-09T01:05:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.12430","created_at":"2026-06-09T01:05:06Z"},{"alias_kind":"pith_short_12","alias_value":"K3JKG77TSHDF","created_at":"2026-06-09T01:05:06Z"},{"alias_kind":"pith_short_16","alias_value":"K3JKG77TSHDFYPDU","created_at":"2026-06-09T01:05:06Z"},{"alias_kind":"pith_short_8","alias_value":"K3JKG77T","created_at":"2026-06-09T01:05:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:K3JKG77TSHDFYPDU7PL4TI7NRD","target":"record","payload":{"canonical_record":{"source":{"id":"2504.12430","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-04-16T18:59:47Z","cross_cats_sorted":[],"title_canon_sha256":"b569d48f192da8e3cc4734cdd2e5d82c694e15b685ca537aaebccccdd848b424","abstract_canon_sha256":"2f7f2a9e2394f94258b2e9af1b9e8f6a3e19115b6dea05205889eabbaccda76b"},"schema_version":"1.0"},"canonical_sha256":"56d2a37ff391c65c3c74fbd7c9a3ed88c7d4ca348d58840ea059a5307b852e4b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-09T01:05:06.371654Z","signature_b64":"mGdnAPC9g22+wrJ9nPtlinJs9/wPYWpc5ugQyaB21dw03whM6Fx+LyOjnJuWTBrwGYD641fWfYAPCpdo9ORjDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"56d2a37ff391c65c3c74fbd7c9a3ed88c7d4ca348d58840ea059a5307b852e4b","last_reissued_at":"2026-06-09T01:05:06.371198Z","signature_status":"signed_v1","first_computed_at":"2026-06-09T01:05:06.371198Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2504.12430","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-06-09T01:05:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iHstT7JClTwNoUG5LPUjLv6tasIqWPLw5n5dAh/9m91xHqdUi8OLn5TMexG91rHDerkwyiNB+65Qwsk4fDMjAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T20:20:44.675103Z"},"content_sha256":"b700b2a2fb6bcf92013fef6fe411f5bb5f3c3c2ac8b08e613fb19e45cafc60ce","schema_version":"1.0","event_id":"sha256:b700b2a2fb6bcf92013fef6fe411f5bb5f3c3c2ac8b08e613fb19e45cafc60ce"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:K3JKG77TSHDFYPDU7PL4TI7NRD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fractional hypergraph coloring","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Margarita Akhmejanova, Sean Longbrake","submitted_at":"2025-04-16T18:59:47Z","abstract_excerpt":"We investigate proper $(a:b)$-fractional colorings of $n$-uniform hypergraphs, which generalize traditional integer colorings of graphs. Each vertex is assigned $b$ distinct colors from a set of $a$ colors, and an edge is properly colored if no single color is shared by all vertices of the edge. A hypergraph is $(a:b)$-colorable if every edge is properly colored. We prove that for any $2\\leq b\\leq a-2\\leq n/\\ln n$, every $n$-uniform hypergraph $H$ with $ |E(H)| \\leq (ab^3)^{-1/2}\\left(\\frac{n}{\\log n}\\right)^{1/2} \\left(\\frac{a}{b}\\right)^{n-1} $ is proper $(a:b)$-colorable. We also address sp"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.12430","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2504.12430/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-06-09T01:05:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"C8pNhVXFBvUBkPSve8EahJrVlE6LG0XJ9KQWGLWXtQLffER8jPP2Eq/1d90MBmsekBzFGVPXZYOSflM+nFnLBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T20:20:44.675509Z"},"content_sha256":"7eeecb238e3b01333e3d4bc96043b395664019c83200483b478b7255f332c81d","schema_version":"1.0","event_id":"sha256:7eeecb238e3b01333e3d4bc96043b395664019c83200483b478b7255f332c81d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/K3JKG77TSHDFYPDU7PL4TI7NRD/bundle.json","state_url":"https://pith.science/pith/K3JKG77TSHDFYPDU7PL4TI7NRD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/K3JKG77TSHDFYPDU7PL4TI7NRD/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-06-30T20:20:44Z","links":{"resolver":"https://pith.science/pith/K3JKG77TSHDFYPDU7PL4TI7NRD","bundle":"https://pith.science/pith/K3JKG77TSHDFYPDU7PL4TI7NRD/bundle.json","state":"https://pith.science/pith/K3JKG77TSHDFYPDU7PL4TI7NRD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/K3JKG77TSHDFYPDU7PL4TI7NRD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:K3JKG77TSHDFYPDU7PL4TI7NRD","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":"2f7f2a9e2394f94258b2e9af1b9e8f6a3e19115b6dea05205889eabbaccda76b","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-04-16T18:59:47Z","title_canon_sha256":"b569d48f192da8e3cc4734cdd2e5d82c694e15b685ca537aaebccccdd848b424"},"schema_version":"1.0","source":{"id":"2504.12430","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2504.12430","created_at":"2026-06-09T01:05:06Z"},{"alias_kind":"arxiv_version","alias_value":"2504.12430v2","created_at":"2026-06-09T01:05:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.12430","created_at":"2026-06-09T01:05:06Z"},{"alias_kind":"pith_short_12","alias_value":"K3JKG77TSHDF","created_at":"2026-06-09T01:05:06Z"},{"alias_kind":"pith_short_16","alias_value":"K3JKG77TSHDFYPDU","created_at":"2026-06-09T01:05:06Z"},{"alias_kind":"pith_short_8","alias_value":"K3JKG77T","created_at":"2026-06-09T01:05:06Z"}],"graph_snapshots":[{"event_id":"sha256:7eeecb238e3b01333e3d4bc96043b395664019c83200483b478b7255f332c81d","target":"graph","created_at":"2026-06-09T01:05:06Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2504.12430/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We investigate proper $(a:b)$-fractional colorings of $n$-uniform hypergraphs, which generalize traditional integer colorings of graphs. Each vertex is assigned $b$ distinct colors from a set of $a$ colors, and an edge is properly colored if no single color is shared by all vertices of the edge. A hypergraph is $(a:b)$-colorable if every edge is properly colored. We prove that for any $2\\leq b\\leq a-2\\leq n/\\ln n$, every $n$-uniform hypergraph $H$ with $ |E(H)| \\leq (ab^3)^{-1/2}\\left(\\frac{n}{\\log n}\\right)^{1/2} \\left(\\frac{a}{b}\\right)^{n-1} $ is proper $(a:b)$-colorable. We also address sp","authors_text":"Margarita Akhmejanova, Sean Longbrake","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-04-16T18:59:47Z","title":"Fractional hypergraph coloring"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.12430","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:b700b2a2fb6bcf92013fef6fe411f5bb5f3c3c2ac8b08e613fb19e45cafc60ce","target":"record","created_at":"2026-06-09T01:05:06Z","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":"2f7f2a9e2394f94258b2e9af1b9e8f6a3e19115b6dea05205889eabbaccda76b","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-04-16T18:59:47Z","title_canon_sha256":"b569d48f192da8e3cc4734cdd2e5d82c694e15b685ca537aaebccccdd848b424"},"schema_version":"1.0","source":{"id":"2504.12430","kind":"arxiv","version":2}},"canonical_sha256":"56d2a37ff391c65c3c74fbd7c9a3ed88c7d4ca348d58840ea059a5307b852e4b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"56d2a37ff391c65c3c74fbd7c9a3ed88c7d4ca348d58840ea059a5307b852e4b","first_computed_at":"2026-06-09T01:05:06.371198Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-09T01:05:06.371198Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mGdnAPC9g22+wrJ9nPtlinJs9/wPYWpc5ugQyaB21dw03whM6Fx+LyOjnJuWTBrwGYD641fWfYAPCpdo9ORjDw==","signature_status":"signed_v1","signed_at":"2026-06-09T01:05:06.371654Z","signed_message":"canonical_sha256_bytes"},"source_id":"2504.12430","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b700b2a2fb6bcf92013fef6fe411f5bb5f3c3c2ac8b08e613fb19e45cafc60ce","sha256:7eeecb238e3b01333e3d4bc96043b395664019c83200483b478b7255f332c81d"],"state_sha256":"dca115273ee7c8ecf7b74f5a6a29beae1c593ff10dcdded0a03fa5c6ce734d83"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NmIsrjn4fOPEcBqmedZXDzkPC4hhdA8RFN+0Qm8bfMEMNoAVL1pAhv9Wt8Z682OwfWOEVGoI5JiN3OeN2IF9BQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-30T20:20:44.677504Z","bundle_sha256":"8ed634659a9036eb8d48770d7ee511900c0b6d106f07d9d1be4259094a766c94"}}