{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:YMABHCT4GRS7BC7XTZN47NHO52","short_pith_number":"pith:YMABHCT4","canonical_record":{"source":{"id":"1710.01472","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-10-04T06:16:30Z","cross_cats_sorted":[],"title_canon_sha256":"34939dd5583e4e14a67a84d08fd47b7c8bd580a27509c666d9654e59a8357ede","abstract_canon_sha256":"cdde6a38db5e2de8a3eff1fa5542a071406df97772dad7a5e8e38d5defb6e107"},"schema_version":"1.0"},"canonical_sha256":"c300138a7c3465f08bf79e5bcfb4eeeea93325ad4fc2e306ab6c20d5f04b7b6a","source":{"kind":"arxiv","id":"1710.01472","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.01472","created_at":"2026-05-18T00:23:45Z"},{"alias_kind":"arxiv_version","alias_value":"1710.01472v4","created_at":"2026-05-18T00:23:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.01472","created_at":"2026-05-18T00:23:45Z"},{"alias_kind":"pith_short_12","alias_value":"YMABHCT4GRS7","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_16","alias_value":"YMABHCT4GRS7BC7X","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_8","alias_value":"YMABHCT4","created_at":"2026-05-18T12:31:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:YMABHCT4GRS7BC7XTZN47NHO52","target":"record","payload":{"canonical_record":{"source":{"id":"1710.01472","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-10-04T06:16:30Z","cross_cats_sorted":[],"title_canon_sha256":"34939dd5583e4e14a67a84d08fd47b7c8bd580a27509c666d9654e59a8357ede","abstract_canon_sha256":"cdde6a38db5e2de8a3eff1fa5542a071406df97772dad7a5e8e38d5defb6e107"},"schema_version":"1.0"},"canonical_sha256":"c300138a7c3465f08bf79e5bcfb4eeeea93325ad4fc2e306ab6c20d5f04b7b6a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:23:45.344457Z","signature_b64":"Fx75OvUETUAxjj6p3D/O7Lx+APMXdgnPA5Sy0DcuH1/SVX+Ait3vA+8o34AwJwc4UTuL67tK6f/fKglWIChKDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c300138a7c3465f08bf79e5bcfb4eeeea93325ad4fc2e306ab6c20d5f04b7b6a","last_reissued_at":"2026-05-18T00:23:45.343878Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:23:45.343878Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1710.01472","source_version":4,"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:23:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zrScFP/3Lq4rtEYbOmiPEqPN9n7ahZqjMW+RoQgMXpQdvYRAeqDDkGdfoMtyYfhFtKe25mDYLwh1FGP2sg8pCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-03T04:33:35.361927Z"},"content_sha256":"0a9a382611d636a52c1f2681993d49b6f31086276a29d0517858d26fb179b094","schema_version":"1.0","event_id":"sha256:0a9a382611d636a52c1f2681993d49b6f31086276a29d0517858d26fb179b094"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:YMABHCT4GRS7BC7XTZN47NHO52","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A new upper bound on the game chromatic index of graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ralph Keusch","submitted_at":"2017-10-04T06:16:30Z","abstract_excerpt":"We study the two-player game where Maker and Breaker alternately color the edges of a given graph $G$ with $k$ colors such that adjacent edges never get the same color. Maker's goal is to play such that at the end of the game, all edges are colored. Vice-versa, Breaker wins as soon as there is an uncolored edge where every color is blocked. The game chromatic index $\\chi'_g(G)$ denotes the smallest $k$ for which Maker has a winning strategy.\n  The trivial bounds $\\Delta(G) \\le \\chi_g'(G) \\le 2\\Delta(G)-1$ hold for every graph $G$, where $\\Delta(G)$ is the maximum degree of $G$. In 2008, Beveri"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.01472","kind":"arxiv","version":4},"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:23:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VLYnfZbhVoAkBae0n1B19lzNs5rYsCULKFigMn5mCDBs/v3IK8goLYbZiZGUCSSM40Ui54b4Wn9YIUvFgywiAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-03T04:33:35.362274Z"},"content_sha256":"4cf168629d632850c80522ccfc488a5e53182f8a2a6d291187998d107da1e1ef","schema_version":"1.0","event_id":"sha256:4cf168629d632850c80522ccfc488a5e53182f8a2a6d291187998d107da1e1ef"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YMABHCT4GRS7BC7XTZN47NHO52/bundle.json","state_url":"https://pith.science/pith/YMABHCT4GRS7BC7XTZN47NHO52/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YMABHCT4GRS7BC7XTZN47NHO52/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-07-03T04:33:35Z","links":{"resolver":"https://pith.science/pith/YMABHCT4GRS7BC7XTZN47NHO52","bundle":"https://pith.science/pith/YMABHCT4GRS7BC7XTZN47NHO52/bundle.json","state":"https://pith.science/pith/YMABHCT4GRS7BC7XTZN47NHO52/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YMABHCT4GRS7BC7XTZN47NHO52/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:YMABHCT4GRS7BC7XTZN47NHO52","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":"cdde6a38db5e2de8a3eff1fa5542a071406df97772dad7a5e8e38d5defb6e107","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-10-04T06:16:30Z","title_canon_sha256":"34939dd5583e4e14a67a84d08fd47b7c8bd580a27509c666d9654e59a8357ede"},"schema_version":"1.0","source":{"id":"1710.01472","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.01472","created_at":"2026-05-18T00:23:45Z"},{"alias_kind":"arxiv_version","alias_value":"1710.01472v4","created_at":"2026-05-18T00:23:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.01472","created_at":"2026-05-18T00:23:45Z"},{"alias_kind":"pith_short_12","alias_value":"YMABHCT4GRS7","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_16","alias_value":"YMABHCT4GRS7BC7X","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_8","alias_value":"YMABHCT4","created_at":"2026-05-18T12:31:56Z"}],"graph_snapshots":[{"event_id":"sha256:4cf168629d632850c80522ccfc488a5e53182f8a2a6d291187998d107da1e1ef","target":"graph","created_at":"2026-05-18T00:23:45Z","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":"We study the two-player game where Maker and Breaker alternately color the edges of a given graph $G$ with $k$ colors such that adjacent edges never get the same color. Maker's goal is to play such that at the end of the game, all edges are colored. Vice-versa, Breaker wins as soon as there is an uncolored edge where every color is blocked. The game chromatic index $\\chi'_g(G)$ denotes the smallest $k$ for which Maker has a winning strategy.\n  The trivial bounds $\\Delta(G) \\le \\chi_g'(G) \\le 2\\Delta(G)-1$ hold for every graph $G$, where $\\Delta(G)$ is the maximum degree of $G$. In 2008, Beveri","authors_text":"Ralph Keusch","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-10-04T06:16:30Z","title":"A new upper bound on the game chromatic index of graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.01472","kind":"arxiv","version":4},"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:0a9a382611d636a52c1f2681993d49b6f31086276a29d0517858d26fb179b094","target":"record","created_at":"2026-05-18T00:23:45Z","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":"cdde6a38db5e2de8a3eff1fa5542a071406df97772dad7a5e8e38d5defb6e107","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-10-04T06:16:30Z","title_canon_sha256":"34939dd5583e4e14a67a84d08fd47b7c8bd580a27509c666d9654e59a8357ede"},"schema_version":"1.0","source":{"id":"1710.01472","kind":"arxiv","version":4}},"canonical_sha256":"c300138a7c3465f08bf79e5bcfb4eeeea93325ad4fc2e306ab6c20d5f04b7b6a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c300138a7c3465f08bf79e5bcfb4eeeea93325ad4fc2e306ab6c20d5f04b7b6a","first_computed_at":"2026-05-18T00:23:45.343878Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:23:45.343878Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Fx75OvUETUAxjj6p3D/O7Lx+APMXdgnPA5Sy0DcuH1/SVX+Ait3vA+8o34AwJwc4UTuL67tK6f/fKglWIChKDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:23:45.344457Z","signed_message":"canonical_sha256_bytes"},"source_id":"1710.01472","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0a9a382611d636a52c1f2681993d49b6f31086276a29d0517858d26fb179b094","sha256:4cf168629d632850c80522ccfc488a5e53182f8a2a6d291187998d107da1e1ef"],"state_sha256":"3deeb8782f5612e3d3040e2c6c6f65ed4b1a3e73e2fbf07802bb4d70cb8f46be"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"41YvciytJkZdNLFbr2/YIjMKh3276vld9RFlmtDyX3XvB4AO3GaSNDN4UhNTt3ZA3NcPoQ2umQAQdVSA+R7ZBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-03T04:33:35.364207Z","bundle_sha256":"552a4b8ad34020d8b2076c9ae068d06cbc3275cbd009b1a2601a3d5df37ffc26"}}