{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:HWRMDXSSXQGA7UGTVC3OXRWVMC","short_pith_number":"pith:HWRMDXSS","canonical_record":{"source":{"id":"1401.3251","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-01-14T16:49:56Z","cross_cats_sorted":[],"title_canon_sha256":"d8359d5dd7e4fcdc0765c00d60a5d5f056eeb39be3737ed9c889a1395eb15025","abstract_canon_sha256":"5d6df3daf80e67b883dec52d39180e7f74c59fb2bdbac1f9930b911caf71797c"},"schema_version":"1.0"},"canonical_sha256":"3da2c1de52bc0c0fd0d3a8b6ebc6d56083eb50a5dbe73707350b01d81725db24","source":{"kind":"arxiv","id":"1401.3251","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.3251","created_at":"2026-05-18T02:34:52Z"},{"alias_kind":"arxiv_version","alias_value":"1401.3251v2","created_at":"2026-05-18T02:34:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.3251","created_at":"2026-05-18T02:34:52Z"},{"alias_kind":"pith_short_12","alias_value":"HWRMDXSSXQGA","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_16","alias_value":"HWRMDXSSXQGA7UGT","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_8","alias_value":"HWRMDXSS","created_at":"2026-05-18T12:28:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:HWRMDXSSXQGA7UGTVC3OXRWVMC","target":"record","payload":{"canonical_record":{"source":{"id":"1401.3251","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-01-14T16:49:56Z","cross_cats_sorted":[],"title_canon_sha256":"d8359d5dd7e4fcdc0765c00d60a5d5f056eeb39be3737ed9c889a1395eb15025","abstract_canon_sha256":"5d6df3daf80e67b883dec52d39180e7f74c59fb2bdbac1f9930b911caf71797c"},"schema_version":"1.0"},"canonical_sha256":"3da2c1de52bc0c0fd0d3a8b6ebc6d56083eb50a5dbe73707350b01d81725db24","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:34:52.521238Z","signature_b64":"CWHlVIHqQlAk3OHiR0LtJU61Juong7xKp5CsCuBBuGogVQHEmf7Twz+aQ0xKEvg1nhufgBjXIP7H6p2OEgXeCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3da2c1de52bc0c0fd0d3a8b6ebc6d56083eb50a5dbe73707350b01d81725db24","last_reissued_at":"2026-05-18T02:34:52.520851Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:34:52.520851Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1401.3251","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-18T02:34:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uy2JwEUYT6ccepcn8fxSqLfX6iDtkTZrpQHMyGWfyH8AOhJHzUh470K5v8ZKIsMelzVWkv7vFdmAqyXsiCsBAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T03:59:15.243538Z"},"content_sha256":"5ade3593f8da253427a0649f4f813e8c7c5c533c119a53fa05ede9f7ddc78e0e","schema_version":"1.0","event_id":"sha256:5ade3593f8da253427a0649f4f813e8c7c5c533c119a53fa05ede9f7ddc78e0e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:HWRMDXSSXQGA7UGTVC3OXRWVMC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The chromatic discrepancy of graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Naveen Sivadasan, N.R. Aravind, R.B. Sandeep, Subrahmanyam Kalyanasundaram","submitted_at":"2014-01-14T16:49:56Z","abstract_excerpt":"For a proper vertex coloring $c$ of a graph $G$, let $\\varphi_c(G)$ denote the maximum, over all induced subgraphs $H$ of $G$, the difference between the chromatic number $\\chi(H)$ and the number of colors used by $c$ to color $H$. We define the chromatic discrepancy of a graph $G$, denoted by $\\varphi(G)$, to be the minimum $\\varphi_c(G)$, over all proper colorings $c$ of $G$. If $H$ is restricted to only connected induced subgraphs, we denote the corresponding parameter by $\\hat{\\varphi}(G)$. These parameters are aimed at studying graph colorings that use as few colors as possible in a graph"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.3251","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-18T02:34:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"z/Gv+toTsdqfthiPA+xrfgz7YzKnX109vX282ADkk3GxOujtSAtYDODGLVlNCcM5VSLJ+e9mcAtXb1YbwXKuBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T03:59:15.243940Z"},"content_sha256":"6b766cbc725a3d158c611901c365d2da4dafa7de545184cb8a76b5bc8e8c4d93","schema_version":"1.0","event_id":"sha256:6b766cbc725a3d158c611901c365d2da4dafa7de545184cb8a76b5bc8e8c4d93"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HWRMDXSSXQGA7UGTVC3OXRWVMC/bundle.json","state_url":"https://pith.science/pith/HWRMDXSSXQGA7UGTVC3OXRWVMC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HWRMDXSSXQGA7UGTVC3OXRWVMC/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-31T03:59:15Z","links":{"resolver":"https://pith.science/pith/HWRMDXSSXQGA7UGTVC3OXRWVMC","bundle":"https://pith.science/pith/HWRMDXSSXQGA7UGTVC3OXRWVMC/bundle.json","state":"https://pith.science/pith/HWRMDXSSXQGA7UGTVC3OXRWVMC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HWRMDXSSXQGA7UGTVC3OXRWVMC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:HWRMDXSSXQGA7UGTVC3OXRWVMC","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":"5d6df3daf80e67b883dec52d39180e7f74c59fb2bdbac1f9930b911caf71797c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-01-14T16:49:56Z","title_canon_sha256":"d8359d5dd7e4fcdc0765c00d60a5d5f056eeb39be3737ed9c889a1395eb15025"},"schema_version":"1.0","source":{"id":"1401.3251","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.3251","created_at":"2026-05-18T02:34:52Z"},{"alias_kind":"arxiv_version","alias_value":"1401.3251v2","created_at":"2026-05-18T02:34:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.3251","created_at":"2026-05-18T02:34:52Z"},{"alias_kind":"pith_short_12","alias_value":"HWRMDXSSXQGA","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_16","alias_value":"HWRMDXSSXQGA7UGT","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_8","alias_value":"HWRMDXSS","created_at":"2026-05-18T12:28:30Z"}],"graph_snapshots":[{"event_id":"sha256:6b766cbc725a3d158c611901c365d2da4dafa7de545184cb8a76b5bc8e8c4d93","target":"graph","created_at":"2026-05-18T02:34:52Z","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":"For a proper vertex coloring $c$ of a graph $G$, let $\\varphi_c(G)$ denote the maximum, over all induced subgraphs $H$ of $G$, the difference between the chromatic number $\\chi(H)$ and the number of colors used by $c$ to color $H$. We define the chromatic discrepancy of a graph $G$, denoted by $\\varphi(G)$, to be the minimum $\\varphi_c(G)$, over all proper colorings $c$ of $G$. If $H$ is restricted to only connected induced subgraphs, we denote the corresponding parameter by $\\hat{\\varphi}(G)$. These parameters are aimed at studying graph colorings that use as few colors as possible in a graph","authors_text":"Naveen Sivadasan, N.R. Aravind, R.B. Sandeep, Subrahmanyam Kalyanasundaram","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-01-14T16:49:56Z","title":"The chromatic discrepancy of graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.3251","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:5ade3593f8da253427a0649f4f813e8c7c5c533c119a53fa05ede9f7ddc78e0e","target":"record","created_at":"2026-05-18T02:34:52Z","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":"5d6df3daf80e67b883dec52d39180e7f74c59fb2bdbac1f9930b911caf71797c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-01-14T16:49:56Z","title_canon_sha256":"d8359d5dd7e4fcdc0765c00d60a5d5f056eeb39be3737ed9c889a1395eb15025"},"schema_version":"1.0","source":{"id":"1401.3251","kind":"arxiv","version":2}},"canonical_sha256":"3da2c1de52bc0c0fd0d3a8b6ebc6d56083eb50a5dbe73707350b01d81725db24","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3da2c1de52bc0c0fd0d3a8b6ebc6d56083eb50a5dbe73707350b01d81725db24","first_computed_at":"2026-05-18T02:34:52.520851Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:34:52.520851Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"CWHlVIHqQlAk3OHiR0LtJU61Juong7xKp5CsCuBBuGogVQHEmf7Twz+aQ0xKEvg1nhufgBjXIP7H6p2OEgXeCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:34:52.521238Z","signed_message":"canonical_sha256_bytes"},"source_id":"1401.3251","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5ade3593f8da253427a0649f4f813e8c7c5c533c119a53fa05ede9f7ddc78e0e","sha256:6b766cbc725a3d158c611901c365d2da4dafa7de545184cb8a76b5bc8e8c4d93"],"state_sha256":"347b6caea46f3d34bb1447984ec80b0acdc4de3666e44913d4075109bf55fe00"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9/OJzZDSeihAizNwfRSP22IRApmEF0xeq5Xaat7PTzBj1+pDFIk1viTXRhGDfVk7WpD+SjI6b0DzA96SXHYfBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T03:59:15.246257Z","bundle_sha256":"5abf0767511a6dd7241b141b3915a35fd3c959cc2f9373dffcefa9171b58aa7d"}}