{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:HAG75B3P5MJID46HVRCFNMLHML","short_pith_number":"pith:HAG75B3P","canonical_record":{"source":{"id":"1203.5765","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-03-26T19:29:01Z","cross_cats_sorted":["cs.DM","math.GR"],"title_canon_sha256":"fa6196ed7ea8e52f3894ab9294c25ca6cdb4d85f5222e17f38983bb7bec2b21f","abstract_canon_sha256":"792aef2ee5a7aef6668412b67e3e3d0a0a9dcbf01ef5223f80eba55cd1402e8b"},"schema_version":"1.0"},"canonical_sha256":"380dfe876feb1281f3c7ac4456b16762f33a4bbd9e4942a397d420047fbd7d38","source":{"kind":"arxiv","id":"1203.5765","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1203.5765","created_at":"2026-05-18T03:59:14Z"},{"alias_kind":"arxiv_version","alias_value":"1203.5765v1","created_at":"2026-05-18T03:59:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.5765","created_at":"2026-05-18T03:59:14Z"},{"alias_kind":"pith_short_12","alias_value":"HAG75B3P5MJI","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_16","alias_value":"HAG75B3P5MJID46H","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_8","alias_value":"HAG75B3P","created_at":"2026-05-18T12:27:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:HAG75B3P5MJID46HVRCFNMLHML","target":"record","payload":{"canonical_record":{"source":{"id":"1203.5765","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-03-26T19:29:01Z","cross_cats_sorted":["cs.DM","math.GR"],"title_canon_sha256":"fa6196ed7ea8e52f3894ab9294c25ca6cdb4d85f5222e17f38983bb7bec2b21f","abstract_canon_sha256":"792aef2ee5a7aef6668412b67e3e3d0a0a9dcbf01ef5223f80eba55cd1402e8b"},"schema_version":"1.0"},"canonical_sha256":"380dfe876feb1281f3c7ac4456b16762f33a4bbd9e4942a397d420047fbd7d38","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:59:14.303451Z","signature_b64":"VdVzAAsUXWgF7GLaRvNyP9kp7qfsBi/zhq4zARU0N/Wik/BTfdFcy+GSGEVvhsueo6UJNn6WzmnyXg2fZgRkAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"380dfe876feb1281f3c7ac4456b16762f33a4bbd9e4942a397d420047fbd7d38","last_reissued_at":"2026-05-18T03:59:14.302723Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:59:14.302723Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1203.5765","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:59:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"E6u1RC1A+nHHPsRQ9vs7cPJkCUDl7qg4C3T413R+t5Q/MFgCNjVU/LAZeIm9ilIq4OzFO0ZV3qdcAXXFjHf/DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-01T17:18:28.023681Z"},"content_sha256":"83c1b6de427b53624dd318c92da84e25686739e25bb870c272ca3f9ce40a2ba7","schema_version":"1.0","event_id":"sha256:83c1b6de427b53624dd318c92da84e25686739e25bb870c272ca3f9ce40a2ba7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:HAG75B3P5MJID46HVRCFNMLHML","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Nordhaus-Gaddum Theorem for the Distinguishing Chromatic Number","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.GR"],"primary_cat":"math.CO","authors_text":"Ann Trenk, Karen L. Collins","submitted_at":"2012-03-26T19:29:01Z","abstract_excerpt":"Nordhaus and Gaddum proved, for any graph G, that the chromatic number of G plus the chromatic number of G complement is less than or equal to the number of vertices in G plus 1. Finck characterized the class of graphs that satisfy equality in this bound. In this paper, we provide a new characterization of this class of graphs, based on vertex degrees, which yields a new polynomial-time recognition algorithm and efficient computation of the chromatic number of graphs in this class. Our motivation comes from our theorem that generalizes the Nordhaus-Gaddum theorem to the distinguishing chromati"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.5765","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:59:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hHARlxEgd4FUMKK8WlSZcCbcmVZirTIvPyUCa13far2svbjQ2gZ4ope0KNOS3gBgYTMU7arbInai19XOJtOnBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-01T17:18:28.024027Z"},"content_sha256":"52123f3bfb0d76cf58bb8c1e8e07a757adfab4d0cdd5bc678933ac7b4581f0ca","schema_version":"1.0","event_id":"sha256:52123f3bfb0d76cf58bb8c1e8e07a757adfab4d0cdd5bc678933ac7b4581f0ca"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HAG75B3P5MJID46HVRCFNMLHML/bundle.json","state_url":"https://pith.science/pith/HAG75B3P5MJID46HVRCFNMLHML/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HAG75B3P5MJID46HVRCFNMLHML/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-01T17:18:28Z","links":{"resolver":"https://pith.science/pith/HAG75B3P5MJID46HVRCFNMLHML","bundle":"https://pith.science/pith/HAG75B3P5MJID46HVRCFNMLHML/bundle.json","state":"https://pith.science/pith/HAG75B3P5MJID46HVRCFNMLHML/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HAG75B3P5MJID46HVRCFNMLHML/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:HAG75B3P5MJID46HVRCFNMLHML","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":"792aef2ee5a7aef6668412b67e3e3d0a0a9dcbf01ef5223f80eba55cd1402e8b","cross_cats_sorted":["cs.DM","math.GR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-03-26T19:29:01Z","title_canon_sha256":"fa6196ed7ea8e52f3894ab9294c25ca6cdb4d85f5222e17f38983bb7bec2b21f"},"schema_version":"1.0","source":{"id":"1203.5765","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1203.5765","created_at":"2026-05-18T03:59:14Z"},{"alias_kind":"arxiv_version","alias_value":"1203.5765v1","created_at":"2026-05-18T03:59:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.5765","created_at":"2026-05-18T03:59:14Z"},{"alias_kind":"pith_short_12","alias_value":"HAG75B3P5MJI","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_16","alias_value":"HAG75B3P5MJID46H","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_8","alias_value":"HAG75B3P","created_at":"2026-05-18T12:27:09Z"}],"graph_snapshots":[{"event_id":"sha256:52123f3bfb0d76cf58bb8c1e8e07a757adfab4d0cdd5bc678933ac7b4581f0ca","target":"graph","created_at":"2026-05-18T03:59:14Z","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":"Nordhaus and Gaddum proved, for any graph G, that the chromatic number of G plus the chromatic number of G complement is less than or equal to the number of vertices in G plus 1. Finck characterized the class of graphs that satisfy equality in this bound. In this paper, we provide a new characterization of this class of graphs, based on vertex degrees, which yields a new polynomial-time recognition algorithm and efficient computation of the chromatic number of graphs in this class. Our motivation comes from our theorem that generalizes the Nordhaus-Gaddum theorem to the distinguishing chromati","authors_text":"Ann Trenk, Karen L. Collins","cross_cats":["cs.DM","math.GR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-03-26T19:29:01Z","title":"Nordhaus-Gaddum Theorem for the Distinguishing Chromatic Number"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.5765","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:83c1b6de427b53624dd318c92da84e25686739e25bb870c272ca3f9ce40a2ba7","target":"record","created_at":"2026-05-18T03:59:14Z","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":"792aef2ee5a7aef6668412b67e3e3d0a0a9dcbf01ef5223f80eba55cd1402e8b","cross_cats_sorted":["cs.DM","math.GR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-03-26T19:29:01Z","title_canon_sha256":"fa6196ed7ea8e52f3894ab9294c25ca6cdb4d85f5222e17f38983bb7bec2b21f"},"schema_version":"1.0","source":{"id":"1203.5765","kind":"arxiv","version":1}},"canonical_sha256":"380dfe876feb1281f3c7ac4456b16762f33a4bbd9e4942a397d420047fbd7d38","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"380dfe876feb1281f3c7ac4456b16762f33a4bbd9e4942a397d420047fbd7d38","first_computed_at":"2026-05-18T03:59:14.302723Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:59:14.302723Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VdVzAAsUXWgF7GLaRvNyP9kp7qfsBi/zhq4zARU0N/Wik/BTfdFcy+GSGEVvhsueo6UJNn6WzmnyXg2fZgRkAA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:59:14.303451Z","signed_message":"canonical_sha256_bytes"},"source_id":"1203.5765","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:83c1b6de427b53624dd318c92da84e25686739e25bb870c272ca3f9ce40a2ba7","sha256:52123f3bfb0d76cf58bb8c1e8e07a757adfab4d0cdd5bc678933ac7b4581f0ca"],"state_sha256":"5c0d5fb555fde8db73440f5726e34c1e51ab30df073844a5e3ecbe8d7b5001b5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"I6sbn++uPqdtbEsmYAQOIldU+6X7vsDNsnF9jTiZMevW+pyeS4/G0/f/2v4F/rPTqxkBy9yOqj4KPNqmqelODA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-01T17:18:28.026190Z","bundle_sha256":"1db75cce39c0f384e1b04a8dc538348e6a6688f1c3b34d169de2fd35ccc5b005"}}