{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:Q6V3GTWJGOA3M3OL73KVS3IPTY","short_pith_number":"pith:Q6V3GTWJ","canonical_record":{"source":{"id":"2507.21560","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2025-07-29T07:51:27Z","cross_cats_sorted":[],"title_canon_sha256":"7e31e9ab485d87eedc4b4f436836430cb6fa7dbab608143147251538292ef262","abstract_canon_sha256":"cda775746e3306c024b31daa8de9e30b4f881a20f4fe68455107675771c24286"},"schema_version":"1.0"},"canonical_sha256":"87abb34ec93381b66dcbfed5596d0f9e32d3d322a4099964c027090cf7464ff4","source":{"kind":"arxiv","id":"2507.21560","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2507.21560","created_at":"2026-07-05T11:45:02Z"},{"alias_kind":"arxiv_version","alias_value":"2507.21560v1","created_at":"2026-07-05T11:45:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.21560","created_at":"2026-07-05T11:45:02Z"},{"alias_kind":"pith_short_12","alias_value":"Q6V3GTWJGOA3","created_at":"2026-07-05T11:45:02Z"},{"alias_kind":"pith_short_16","alias_value":"Q6V3GTWJGOA3M3OL","created_at":"2026-07-05T11:45:02Z"},{"alias_kind":"pith_short_8","alias_value":"Q6V3GTWJ","created_at":"2026-07-05T11:45:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:Q6V3GTWJGOA3M3OL73KVS3IPTY","target":"record","payload":{"canonical_record":{"source":{"id":"2507.21560","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2025-07-29T07:51:27Z","cross_cats_sorted":[],"title_canon_sha256":"7e31e9ab485d87eedc4b4f436836430cb6fa7dbab608143147251538292ef262","abstract_canon_sha256":"cda775746e3306c024b31daa8de9e30b4f881a20f4fe68455107675771c24286"},"schema_version":"1.0"},"canonical_sha256":"87abb34ec93381b66dcbfed5596d0f9e32d3d322a4099964c027090cf7464ff4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:45:02.276801Z","signature_b64":"Jrvpb/faDp9NwCKZLk7vVXDViRu4hn9vBTHWTBNKYtvfsbtVy94Kjg1llHtwgY6VsyIhP58q90PPJ5SJPYf+Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"87abb34ec93381b66dcbfed5596d0f9e32d3d322a4099964c027090cf7464ff4","last_reissued_at":"2026-07-05T11:45:02.276366Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:45:02.276366Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2507.21560","source_version":1,"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-07-05T11:45:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bp67jYz6yoirziH/f+YqsSuhg2k7tUIFs4r8n/hmLIgfNTIWPxpYGaAhaaI/YLkoFMUnYonjYY1zmd2F1WkLAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T18:03:30.261290Z"},"content_sha256":"7e93f669d9e4d6eff01cb1ea9846ce57f14c211b0fbd47d64545d89eb61ca15f","schema_version":"1.0","event_id":"sha256:7e93f669d9e4d6eff01cb1ea9846ce57f14c211b0fbd47d64545d89eb61ca15f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:Q6V3GTWJGOA3M3OL73KVS3IPTY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Online Edge Coloring: Sharp Thresholds","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"David Wajc, Joakim Blikstad, Ola Svensson, Radu Vintan","submitted_at":"2025-07-29T07:51:27Z","abstract_excerpt":"Vizing's theorem guarantees that every graph with maximum degree $\\Delta$ admits an edge coloring using $\\Delta + 1$ colors. In online settings - where edges arrive one at a time and must be colored immediately - a simple greedy algorithm uses at most $2\\Delta - 1$ colors. Over thirty years ago, Bar-Noy, Motwani, and Naor [IPL'92] proved that this guarantee is optimal among deterministic algorithms when $\\Delta = O(\\log n)$, and among randomized algorithms when $\\Delta = O(\\sqrt{\\log n})$. While deterministic improvements seemed out of reach, they conjectured that for graphs with $\\Delta = \\om"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.21560","kind":"arxiv","version":1},"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/2507.21560/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-07-05T11:45:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9+5pCIZYk/JTwPcd/CHMp0kStrAKB4jCf8hMIbRc5sJuMMhea6+ykLT29GiCm98zi1zaZ+Fcezb3Xfj0pMVlCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T18:03:30.261706Z"},"content_sha256":"6b77a23fbf19ce76c4603d30ab076833c5e4c030382d5fc9aee87f435b3de763","schema_version":"1.0","event_id":"sha256:6b77a23fbf19ce76c4603d30ab076833c5e4c030382d5fc9aee87f435b3de763"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Q6V3GTWJGOA3M3OL73KVS3IPTY/bundle.json","state_url":"https://pith.science/pith/Q6V3GTWJGOA3M3OL73KVS3IPTY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Q6V3GTWJGOA3M3OL73KVS3IPTY/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-08-11T18:03:30Z","links":{"resolver":"https://pith.science/pith/Q6V3GTWJGOA3M3OL73KVS3IPTY","bundle":"https://pith.science/pith/Q6V3GTWJGOA3M3OL73KVS3IPTY/bundle.json","state":"https://pith.science/pith/Q6V3GTWJGOA3M3OL73KVS3IPTY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Q6V3GTWJGOA3M3OL73KVS3IPTY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:Q6V3GTWJGOA3M3OL73KVS3IPTY","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":"cda775746e3306c024b31daa8de9e30b4f881a20f4fe68455107675771c24286","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2025-07-29T07:51:27Z","title_canon_sha256":"7e31e9ab485d87eedc4b4f436836430cb6fa7dbab608143147251538292ef262"},"schema_version":"1.0","source":{"id":"2507.21560","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2507.21560","created_at":"2026-07-05T11:45:02Z"},{"alias_kind":"arxiv_version","alias_value":"2507.21560v1","created_at":"2026-07-05T11:45:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.21560","created_at":"2026-07-05T11:45:02Z"},{"alias_kind":"pith_short_12","alias_value":"Q6V3GTWJGOA3","created_at":"2026-07-05T11:45:02Z"},{"alias_kind":"pith_short_16","alias_value":"Q6V3GTWJGOA3M3OL","created_at":"2026-07-05T11:45:02Z"},{"alias_kind":"pith_short_8","alias_value":"Q6V3GTWJ","created_at":"2026-07-05T11:45:02Z"}],"graph_snapshots":[{"event_id":"sha256:6b77a23fbf19ce76c4603d30ab076833c5e4c030382d5fc9aee87f435b3de763","target":"graph","created_at":"2026-07-05T11:45:02Z","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/2507.21560/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Vizing's theorem guarantees that every graph with maximum degree $\\Delta$ admits an edge coloring using $\\Delta + 1$ colors. In online settings - where edges arrive one at a time and must be colored immediately - a simple greedy algorithm uses at most $2\\Delta - 1$ colors. Over thirty years ago, Bar-Noy, Motwani, and Naor [IPL'92] proved that this guarantee is optimal among deterministic algorithms when $\\Delta = O(\\log n)$, and among randomized algorithms when $\\Delta = O(\\sqrt{\\log n})$. While deterministic improvements seemed out of reach, they conjectured that for graphs with $\\Delta = \\om","authors_text":"David Wajc, Joakim Blikstad, Ola Svensson, Radu Vintan","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2025-07-29T07:51:27Z","title":"Online Edge Coloring: Sharp Thresholds"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.21560","kind":"arxiv","version":1},"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:7e93f669d9e4d6eff01cb1ea9846ce57f14c211b0fbd47d64545d89eb61ca15f","target":"record","created_at":"2026-07-05T11:45:02Z","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":"cda775746e3306c024b31daa8de9e30b4f881a20f4fe68455107675771c24286","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2025-07-29T07:51:27Z","title_canon_sha256":"7e31e9ab485d87eedc4b4f436836430cb6fa7dbab608143147251538292ef262"},"schema_version":"1.0","source":{"id":"2507.21560","kind":"arxiv","version":1}},"canonical_sha256":"87abb34ec93381b66dcbfed5596d0f9e32d3d322a4099964c027090cf7464ff4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"87abb34ec93381b66dcbfed5596d0f9e32d3d322a4099964c027090cf7464ff4","first_computed_at":"2026-07-05T11:45:02.276366Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:45:02.276366Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Jrvpb/faDp9NwCKZLk7vVXDViRu4hn9vBTHWTBNKYtvfsbtVy94Kjg1llHtwgY6VsyIhP58q90PPJ5SJPYf+Dw==","signature_status":"signed_v1","signed_at":"2026-07-05T11:45:02.276801Z","signed_message":"canonical_sha256_bytes"},"source_id":"2507.21560","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7e93f669d9e4d6eff01cb1ea9846ce57f14c211b0fbd47d64545d89eb61ca15f","sha256:6b77a23fbf19ce76c4603d30ab076833c5e4c030382d5fc9aee87f435b3de763"],"state_sha256":"0a5f4b916376d0ac9b7ffdba2695b0b6dff3c133a0aab0060b6accc1fbe649df"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AI5c3iCnnLsjnoSB4jBS0bXNqEiWwB0gdvazb54FMH3nuJ0guYYpzRim5IA3keI9SC8HIRCko93C7PfOtEmXCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-11T18:03:30.264329Z","bundle_sha256":"a78f6c83d5d8bb3451ffd34137cf7a252dc5a690fc450855e0f1e0125ca68b27"}}