{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:U7QQFVQ5ZREVHDTSETVMHGAUED","short_pith_number":"pith:U7QQFVQ5","canonical_record":{"source":{"id":"1312.7522","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-12-29T11:31:32Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"9c4b8abd75f7a7ee0dda38c0ecb54e7e5ce8bdda907823472a6d9c625789b1ec","abstract_canon_sha256":"3c3921b764243f07c64d1a68cd86390b1eff31984ab0b722d3e85f52b7e2e7aa"},"schema_version":"1.0"},"canonical_sha256":"a7e102d61dcc49538e7224eac3981420cc9ccfcd51a68ba24964df56190cc79b","source":{"kind":"arxiv","id":"1312.7522","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.7522","created_at":"2026-05-18T03:03:43Z"},{"alias_kind":"arxiv_version","alias_value":"1312.7522v1","created_at":"2026-05-18T03:03:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.7522","created_at":"2026-05-18T03:03:43Z"},{"alias_kind":"pith_short_12","alias_value":"U7QQFVQ5ZREV","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_16","alias_value":"U7QQFVQ5ZREVHDTS","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_8","alias_value":"U7QQFVQ5","created_at":"2026-05-18T12:28:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:U7QQFVQ5ZREVHDTSETVMHGAUED","target":"record","payload":{"canonical_record":{"source":{"id":"1312.7522","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-12-29T11:31:32Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"9c4b8abd75f7a7ee0dda38c0ecb54e7e5ce8bdda907823472a6d9c625789b1ec","abstract_canon_sha256":"3c3921b764243f07c64d1a68cd86390b1eff31984ab0b722d3e85f52b7e2e7aa"},"schema_version":"1.0"},"canonical_sha256":"a7e102d61dcc49538e7224eac3981420cc9ccfcd51a68ba24964df56190cc79b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:03:43.202567Z","signature_b64":"/ehJMYA3HreaKaFhRXkFLWO6hZcIz/SktFR/VY3s8Ddr6pczAAeEZPTzYHg8pWknA6figjshSPyfhpRfaxowDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a7e102d61dcc49538e7224eac3981420cc9ccfcd51a68ba24964df56190cc79b","last_reissued_at":"2026-05-18T03:03:43.201927Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:03:43.201927Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1312.7522","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-05-18T03:03:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1AD04aiE8IV/+3XH2xAvcCX+mXJHYUqMka2J3EEHgd4fK3/xG/29bzNrRfTEbVS0HzOSC0n3ZJARBWBpND7ZBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T04:17:11.030949Z"},"content_sha256":"cbcd3472bd86e94a024b7ac4f3bc41f73068eefcb232516f866b95e8d0ec8e02","schema_version":"1.0","event_id":"sha256:cbcd3472bd86e94a024b7ac4f3bc41f73068eefcb232516f866b95e8d0ec8e02"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:U7QQFVQ5ZREVHDTSETVMHGAUED","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Minimum order of graphs with given coloring parameters","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Gabor Bacso, Mihaly Hujter, Piotr Borowiecki, Zsolt Tuza","submitted_at":"2013-12-29T11:31:32Z","abstract_excerpt":"A complete $k$-coloring of a graph $G=(V,E)$ is an assignment $\\varphi:V\\to\\{1,\\ldots,k\\}$ of colors to the vertices such that no two vertices of the same color are adjacent, and the union of any two color classes contains at least one edge. Three extensively investigated graph invariants related to complete colorings are the minimum and maximum number of colors in a complete coloring (chromatic number $\\chi(G)$ and achromatic number $\\psi(G)$, respectively), and the Grundy number $\\Gamma(G)$ defined as the largest $k$ admitting a complete coloring $\\varphi$ with exactly $k$ colors such that e"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.7522","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":""},"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-18T03:03:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oyzxQxaVA302gRiFSoohnlE6gv9BJSAaRcvzQi5Mqu8ZBn99oQOsdF3k+CR3nEKi8OsXW5KUKRPPd43IiK/2CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T04:17:11.031299Z"},"content_sha256":"c6d78cdddbe55730e68b396b42f2ff3284857c04d204e517592e7f5e111c0c26","schema_version":"1.0","event_id":"sha256:c6d78cdddbe55730e68b396b42f2ff3284857c04d204e517592e7f5e111c0c26"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/U7QQFVQ5ZREVHDTSETVMHGAUED/bundle.json","state_url":"https://pith.science/pith/U7QQFVQ5ZREVHDTSETVMHGAUED/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/U7QQFVQ5ZREVHDTSETVMHGAUED/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-30T04:17:11Z","links":{"resolver":"https://pith.science/pith/U7QQFVQ5ZREVHDTSETVMHGAUED","bundle":"https://pith.science/pith/U7QQFVQ5ZREVHDTSETVMHGAUED/bundle.json","state":"https://pith.science/pith/U7QQFVQ5ZREVHDTSETVMHGAUED/state.json","well_known_bundle":"https://pith.science/.well-known/pith/U7QQFVQ5ZREVHDTSETVMHGAUED/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:U7QQFVQ5ZREVHDTSETVMHGAUED","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":"3c3921b764243f07c64d1a68cd86390b1eff31984ab0b722d3e85f52b7e2e7aa","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-12-29T11:31:32Z","title_canon_sha256":"9c4b8abd75f7a7ee0dda38c0ecb54e7e5ce8bdda907823472a6d9c625789b1ec"},"schema_version":"1.0","source":{"id":"1312.7522","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.7522","created_at":"2026-05-18T03:03:43Z"},{"alias_kind":"arxiv_version","alias_value":"1312.7522v1","created_at":"2026-05-18T03:03:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.7522","created_at":"2026-05-18T03:03:43Z"},{"alias_kind":"pith_short_12","alias_value":"U7QQFVQ5ZREV","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_16","alias_value":"U7QQFVQ5ZREVHDTS","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_8","alias_value":"U7QQFVQ5","created_at":"2026-05-18T12:28:02Z"}],"graph_snapshots":[{"event_id":"sha256:c6d78cdddbe55730e68b396b42f2ff3284857c04d204e517592e7f5e111c0c26","target":"graph","created_at":"2026-05-18T03:03:43Z","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 complete $k$-coloring of a graph $G=(V,E)$ is an assignment $\\varphi:V\\to\\{1,\\ldots,k\\}$ of colors to the vertices such that no two vertices of the same color are adjacent, and the union of any two color classes contains at least one edge. Three extensively investigated graph invariants related to complete colorings are the minimum and maximum number of colors in a complete coloring (chromatic number $\\chi(G)$ and achromatic number $\\psi(G)$, respectively), and the Grundy number $\\Gamma(G)$ defined as the largest $k$ admitting a complete coloring $\\varphi$ with exactly $k$ colors such that e","authors_text":"Gabor Bacso, Mihaly Hujter, Piotr Borowiecki, Zsolt Tuza","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-12-29T11:31:32Z","title":"Minimum order of graphs with given coloring parameters"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.7522","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:cbcd3472bd86e94a024b7ac4f3bc41f73068eefcb232516f866b95e8d0ec8e02","target":"record","created_at":"2026-05-18T03:03:43Z","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":"3c3921b764243f07c64d1a68cd86390b1eff31984ab0b722d3e85f52b7e2e7aa","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-12-29T11:31:32Z","title_canon_sha256":"9c4b8abd75f7a7ee0dda38c0ecb54e7e5ce8bdda907823472a6d9c625789b1ec"},"schema_version":"1.0","source":{"id":"1312.7522","kind":"arxiv","version":1}},"canonical_sha256":"a7e102d61dcc49538e7224eac3981420cc9ccfcd51a68ba24964df56190cc79b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a7e102d61dcc49538e7224eac3981420cc9ccfcd51a68ba24964df56190cc79b","first_computed_at":"2026-05-18T03:03:43.201927Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:03:43.201927Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/ehJMYA3HreaKaFhRXkFLWO6hZcIz/SktFR/VY3s8Ddr6pczAAeEZPTzYHg8pWknA6figjshSPyfhpRfaxowDw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:03:43.202567Z","signed_message":"canonical_sha256_bytes"},"source_id":"1312.7522","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cbcd3472bd86e94a024b7ac4f3bc41f73068eefcb232516f866b95e8d0ec8e02","sha256:c6d78cdddbe55730e68b396b42f2ff3284857c04d204e517592e7f5e111c0c26"],"state_sha256":"f3dd46000ee9780615144dd715bfeca7b5cbb7d8d64ff001eabad67e849346aa"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XAsKGEU/Z27Pn66JRTbDgxQwdN+NdSaYLx7rUQ8RjivRJgbJbVTPIB5bMsh29YCXf/4lORN5jSNnQHkEgHcbDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T04:17:11.035524Z","bundle_sha256":"f26360c647e9137c82cf373951e0184ac6305a4c6e4f10f35a98a98543745243"}}