{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:HNAH6MAPP6MUAXG2MUDQJ33M3D","short_pith_number":"pith:HNAH6MAP","canonical_record":{"source":{"id":"1605.06574","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-05-21T02:27:02Z","cross_cats_sorted":[],"title_canon_sha256":"6c3a29ae8ea0ac8729097e2786b77e88db269b5446be90b9d2952ffb63aa4b93","abstract_canon_sha256":"c7952580fbce78e7a402633599042dde8940816ae4610b92541452b5afe9ac75"},"schema_version":"1.0"},"canonical_sha256":"3b407f300f7f99405cda650704ef6cd8fe21c5e948b85a435d9ba32f04ae193c","source":{"kind":"arxiv","id":"1605.06574","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.06574","created_at":"2026-05-18T01:13:46Z"},{"alias_kind":"arxiv_version","alias_value":"1605.06574v2","created_at":"2026-05-18T01:13:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.06574","created_at":"2026-05-18T01:13:46Z"},{"alias_kind":"pith_short_12","alias_value":"HNAH6MAPP6MU","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_16","alias_value":"HNAH6MAPP6MUAXG2","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_8","alias_value":"HNAH6MAP","created_at":"2026-05-18T12:30:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:HNAH6MAPP6MUAXG2MUDQJ33M3D","target":"record","payload":{"canonical_record":{"source":{"id":"1605.06574","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-05-21T02:27:02Z","cross_cats_sorted":[],"title_canon_sha256":"6c3a29ae8ea0ac8729097e2786b77e88db269b5446be90b9d2952ffb63aa4b93","abstract_canon_sha256":"c7952580fbce78e7a402633599042dde8940816ae4610b92541452b5afe9ac75"},"schema_version":"1.0"},"canonical_sha256":"3b407f300f7f99405cda650704ef6cd8fe21c5e948b85a435d9ba32f04ae193c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:13:46.753555Z","signature_b64":"MxcnJUiAjcWxgrKLOLHx8Xvi0duzBBkRiGo7QCyF2ZLrcEVjuaPjU9xDGeruOt1TmKyWoEsjfWOmp8U+OXNZBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3b407f300f7f99405cda650704ef6cd8fe21c5e948b85a435d9ba32f04ae193c","last_reissued_at":"2026-05-18T01:13:46.752906Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:13:46.752906Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1605.06574","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-18T01:13:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"A10FcYuSpyPvUU6o5Xhuc2YjufGHCvGqBa9enAw6/+tZiX42oznbCwF3rwNuC2K94ZAsO9TyhRrKGKSdutvdCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T01:30:20.110084Z"},"content_sha256":"1b288d0f3224df619ca94153c3cad260c3f5c3ece47a4c2d79e58bd17e00168c","schema_version":"1.0","event_id":"sha256:1b288d0f3224df619ca94153c3cad260c3f5c3ece47a4c2d79e58bd17e00168c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:HNAH6MAPP6MUAXG2MUDQJ33M3D","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the strong chromatic number of graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Maria Axenovich, Ryan R. Martin","submitted_at":"2016-05-21T02:27:02Z","abstract_excerpt":"The strong chromatic number, $\\chi_S(G)$, of an $n$-vertex graph $G$ is the smallest number $k$ such that after adding $k\\lceil n/k\\rceil-n$ isolated vertices to $G$ and considering {\\bf any} partition of the vertices of the resulting graph into disjoint subsets $V_1, \\ldots, V_{\\lceil n/k\\rceil}$ of size $k$ each, one can find a proper $k$-vertex-coloring of the graph such that each part $V_i$, $i=1, \\ldots, \\lceil n/k\\rceil$, contains exactly one vertex of each color.\n  For any graph $G$ with maximum degree $\\Delta$, it is easy to see that $\\chi_S(G)\\geq\\Delta+1$. Recently, Haxell proved tha"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.06574","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-18T01:13:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"coyLt0RaYwhZOA2sOzAPJ35oSDsxwb8yEKgb3mL+fyea0oErZQnjJGt+JX1QdPU7QfQayR9fI4aGv3W0j+00Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T01:30:20.110463Z"},"content_sha256":"a110f296aec2e9f29f27255d29f4af91ed6b748f6a8aa57b2c0efae2f02d9a60","schema_version":"1.0","event_id":"sha256:a110f296aec2e9f29f27255d29f4af91ed6b748f6a8aa57b2c0efae2f02d9a60"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HNAH6MAPP6MUAXG2MUDQJ33M3D/bundle.json","state_url":"https://pith.science/pith/HNAH6MAPP6MUAXG2MUDQJ33M3D/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HNAH6MAPP6MUAXG2MUDQJ33M3D/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-19T01:30:20Z","links":{"resolver":"https://pith.science/pith/HNAH6MAPP6MUAXG2MUDQJ33M3D","bundle":"https://pith.science/pith/HNAH6MAPP6MUAXG2MUDQJ33M3D/bundle.json","state":"https://pith.science/pith/HNAH6MAPP6MUAXG2MUDQJ33M3D/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HNAH6MAPP6MUAXG2MUDQJ33M3D/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:HNAH6MAPP6MUAXG2MUDQJ33M3D","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":"c7952580fbce78e7a402633599042dde8940816ae4610b92541452b5afe9ac75","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-05-21T02:27:02Z","title_canon_sha256":"6c3a29ae8ea0ac8729097e2786b77e88db269b5446be90b9d2952ffb63aa4b93"},"schema_version":"1.0","source":{"id":"1605.06574","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.06574","created_at":"2026-05-18T01:13:46Z"},{"alias_kind":"arxiv_version","alias_value":"1605.06574v2","created_at":"2026-05-18T01:13:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.06574","created_at":"2026-05-18T01:13:46Z"},{"alias_kind":"pith_short_12","alias_value":"HNAH6MAPP6MU","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_16","alias_value":"HNAH6MAPP6MUAXG2","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_8","alias_value":"HNAH6MAP","created_at":"2026-05-18T12:30:19Z"}],"graph_snapshots":[{"event_id":"sha256:a110f296aec2e9f29f27255d29f4af91ed6b748f6a8aa57b2c0efae2f02d9a60","target":"graph","created_at":"2026-05-18T01:13:46Z","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 strong chromatic number, $\\chi_S(G)$, of an $n$-vertex graph $G$ is the smallest number $k$ such that after adding $k\\lceil n/k\\rceil-n$ isolated vertices to $G$ and considering {\\bf any} partition of the vertices of the resulting graph into disjoint subsets $V_1, \\ldots, V_{\\lceil n/k\\rceil}$ of size $k$ each, one can find a proper $k$-vertex-coloring of the graph such that each part $V_i$, $i=1, \\ldots, \\lceil n/k\\rceil$, contains exactly one vertex of each color.\n  For any graph $G$ with maximum degree $\\Delta$, it is easy to see that $\\chi_S(G)\\geq\\Delta+1$. Recently, Haxell proved tha","authors_text":"Maria Axenovich, Ryan R. Martin","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-05-21T02:27:02Z","title":"On the strong chromatic number of graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.06574","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:1b288d0f3224df619ca94153c3cad260c3f5c3ece47a4c2d79e58bd17e00168c","target":"record","created_at":"2026-05-18T01:13:46Z","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":"c7952580fbce78e7a402633599042dde8940816ae4610b92541452b5afe9ac75","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-05-21T02:27:02Z","title_canon_sha256":"6c3a29ae8ea0ac8729097e2786b77e88db269b5446be90b9d2952ffb63aa4b93"},"schema_version":"1.0","source":{"id":"1605.06574","kind":"arxiv","version":2}},"canonical_sha256":"3b407f300f7f99405cda650704ef6cd8fe21c5e948b85a435d9ba32f04ae193c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3b407f300f7f99405cda650704ef6cd8fe21c5e948b85a435d9ba32f04ae193c","first_computed_at":"2026-05-18T01:13:46.752906Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:13:46.752906Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"MxcnJUiAjcWxgrKLOLHx8Xvi0duzBBkRiGo7QCyF2ZLrcEVjuaPjU9xDGeruOt1TmKyWoEsjfWOmp8U+OXNZBg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:13:46.753555Z","signed_message":"canonical_sha256_bytes"},"source_id":"1605.06574","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1b288d0f3224df619ca94153c3cad260c3f5c3ece47a4c2d79e58bd17e00168c","sha256:a110f296aec2e9f29f27255d29f4af91ed6b748f6a8aa57b2c0efae2f02d9a60"],"state_sha256":"a93c0b060fe5a843293845a2729a1c850f9b20d1915fe283afeb05f65ecd8d73"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aozJSQaBkZ9gP3zSO+bha4d8kIuKTagNuGTiSoefdPS0IIVJb8c7cPgbpPGCg/qS8acQr+KzKdJW3zXDOuQpBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-19T01:30:20.111970Z","bundle_sha256":"6d6945cd8bffcecf37021d5039e1a64c83f3082064fe29ab92cd6674c04c1dd6"}}