{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:HWRMDXSSXQGA7UGTVC3OXRWVMC","short_pith_number":"pith:HWRMDXSS","schema_version":"1.0","canonical_sha256":"3da2c1de52bc0c0fd0d3a8b6ebc6d56083eb50a5dbe73707350b01d81725db24","source":{"kind":"arxiv","id":"1401.3251","version":2},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1401.3251","created_at":"2026-05-18T02:34:52.520910+00:00"},{"alias_kind":"arxiv_version","alias_value":"1401.3251v2","created_at":"2026-05-18T02:34:52.520910+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.3251","created_at":"2026-05-18T02:34:52.520910+00:00"},{"alias_kind":"pith_short_12","alias_value":"HWRMDXSSXQGA","created_at":"2026-05-18T12:28:30.664211+00:00"},{"alias_kind":"pith_short_16","alias_value":"HWRMDXSSXQGA7UGT","created_at":"2026-05-18T12:28:30.664211+00:00"},{"alias_kind":"pith_short_8","alias_value":"HWRMDXSS","created_at":"2026-05-18T12:28:30.664211+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/HWRMDXSSXQGA7UGTVC3OXRWVMC","json":"https://pith.science/pith/HWRMDXSSXQGA7UGTVC3OXRWVMC.json","graph_json":"https://pith.science/api/pith-number/HWRMDXSSXQGA7UGTVC3OXRWVMC/graph.json","events_json":"https://pith.science/api/pith-number/HWRMDXSSXQGA7UGTVC3OXRWVMC/events.json","paper":"https://pith.science/paper/HWRMDXSS"},"agent_actions":{"view_html":"https://pith.science/pith/HWRMDXSSXQGA7UGTVC3OXRWVMC","download_json":"https://pith.science/pith/HWRMDXSSXQGA7UGTVC3OXRWVMC.json","view_paper":"https://pith.science/paper/HWRMDXSS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1401.3251&json=true","fetch_graph":"https://pith.science/api/pith-number/HWRMDXSSXQGA7UGTVC3OXRWVMC/graph.json","fetch_events":"https://pith.science/api/pith-number/HWRMDXSSXQGA7UGTVC3OXRWVMC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HWRMDXSSXQGA7UGTVC3OXRWVMC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HWRMDXSSXQGA7UGTVC3OXRWVMC/action/storage_attestation","attest_author":"https://pith.science/pith/HWRMDXSSXQGA7UGTVC3OXRWVMC/action/author_attestation","sign_citation":"https://pith.science/pith/HWRMDXSSXQGA7UGTVC3OXRWVMC/action/citation_signature","submit_replication":"https://pith.science/pith/HWRMDXSSXQGA7UGTVC3OXRWVMC/action/replication_record"}},"created_at":"2026-05-18T02:34:52.520910+00:00","updated_at":"2026-05-18T02:34:52.520910+00:00"}