{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:DTR5X7KKZQ243O4EB3N7S7UTIC","short_pith_number":"pith:DTR5X7KK","schema_version":"1.0","canonical_sha256":"1ce3dbfd4acc35cdbb840edbf97e9340879e4ee64d121e1222eb47da7d2b8323","source":{"kind":"arxiv","id":"2405.17819","version":1},"attestation_state":"computed","paper":{"title":"An optimal chromatic bound for ($P_2+P_3$, gem)-free graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Arnab Char, T. Karthick","submitted_at":"2024-05-28T04:38:40Z","abstract_excerpt":"Given a graph $G$, the parameters $\\chi(G)$ and $\\omega(G)$ respectively denote the chromatic number and the clique number of $G$. A function $f : \\mathbb{N} \\rightarrow \\mathbb{N}$ such that $f(1) = 1$ and $f(x) \\geq x$, for all $x \\in \\mathbb{N}$ is called a $\\chi$-binding function for the given class of graphs $\\cal{G}$ if every $G \\in \\cal{G}$ satisfies $\\chi(G) \\leq f(\\omega(G))$, and the \\emph{smallest $\\chi$-binding function} $f^*$ for $\\cal{G}$ is defined as $f^*(x) := \\max\\{\\chi(G)\\mid G\\in {\\cal G} \\mbox{ and } \\omega(G)=x\\}$. In general, the problem of obtaining the smallest $\\chi$-"},"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":"2405.17819","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-05-28T04:38:40Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"6387be8f718cc1ee778a98f7ab2de2bfa0b8d0f2893833804d112eb960a73b46","abstract_canon_sha256":"fae7c0183ba34491a19826c8400988566309c37f033348ea5b2bad867203d3f3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:24:11.751158Z","signature_b64":"aOGrMqpFXO95TDQVOBPUWLEyLtortFV0ahqEoRdsx36Fj4L2BsetsY/e1MOtuq3FIFLfhIrsSElB3DqZvmXGAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1ce3dbfd4acc35cdbb840edbf97e9340879e4ee64d121e1222eb47da7d2b8323","last_reissued_at":"2026-07-05T08:24:11.750633Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:24:11.750633Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An optimal chromatic bound for ($P_2+P_3$, gem)-free graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Arnab Char, T. Karthick","submitted_at":"2024-05-28T04:38:40Z","abstract_excerpt":"Given a graph $G$, the parameters $\\chi(G)$ and $\\omega(G)$ respectively denote the chromatic number and the clique number of $G$. A function $f : \\mathbb{N} \\rightarrow \\mathbb{N}$ such that $f(1) = 1$ and $f(x) \\geq x$, for all $x \\in \\mathbb{N}$ is called a $\\chi$-binding function for the given class of graphs $\\cal{G}$ if every $G \\in \\cal{G}$ satisfies $\\chi(G) \\leq f(\\omega(G))$, and the \\emph{smallest $\\chi$-binding function} $f^*$ for $\\cal{G}$ is defined as $f^*(x) := \\max\\{\\chi(G)\\mid G\\in {\\cal G} \\mbox{ and } \\omega(G)=x\\}$. In general, the problem of obtaining the smallest $\\chi$-"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2405.17819","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2405.17819/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2405.17819","created_at":"2026-07-05T08:24:11.750697+00:00"},{"alias_kind":"arxiv_version","alias_value":"2405.17819v1","created_at":"2026-07-05T08:24:11.750697+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2405.17819","created_at":"2026-07-05T08:24:11.750697+00:00"},{"alias_kind":"pith_short_12","alias_value":"DTR5X7KKZQ24","created_at":"2026-07-05T08:24:11.750697+00:00"},{"alias_kind":"pith_short_16","alias_value":"DTR5X7KKZQ243O4E","created_at":"2026-07-05T08:24:11.750697+00:00"},{"alias_kind":"pith_short_8","alias_value":"DTR5X7KK","created_at":"2026-07-05T08:24:11.750697+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2412.14524","citing_title":"Coloring of some $(P_2\\cup P_4)$-free graphs","ref_index":5,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/DTR5X7KKZQ243O4EB3N7S7UTIC","json":"https://pith.science/pith/DTR5X7KKZQ243O4EB3N7S7UTIC.json","graph_json":"https://pith.science/api/pith-number/DTR5X7KKZQ243O4EB3N7S7UTIC/graph.json","events_json":"https://pith.science/api/pith-number/DTR5X7KKZQ243O4EB3N7S7UTIC/events.json","paper":"https://pith.science/paper/DTR5X7KK"},"agent_actions":{"view_html":"https://pith.science/pith/DTR5X7KKZQ243O4EB3N7S7UTIC","download_json":"https://pith.science/pith/DTR5X7KKZQ243O4EB3N7S7UTIC.json","view_paper":"https://pith.science/paper/DTR5X7KK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2405.17819&json=true","fetch_graph":"https://pith.science/api/pith-number/DTR5X7KKZQ243O4EB3N7S7UTIC/graph.json","fetch_events":"https://pith.science/api/pith-number/DTR5X7KKZQ243O4EB3N7S7UTIC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DTR5X7KKZQ243O4EB3N7S7UTIC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DTR5X7KKZQ243O4EB3N7S7UTIC/action/storage_attestation","attest_author":"https://pith.science/pith/DTR5X7KKZQ243O4EB3N7S7UTIC/action/author_attestation","sign_citation":"https://pith.science/pith/DTR5X7KKZQ243O4EB3N7S7UTIC/action/citation_signature","submit_replication":"https://pith.science/pith/DTR5X7KKZQ243O4EB3N7S7UTIC/action/replication_record"}},"created_at":"2026-07-05T08:24:11.750697+00:00","updated_at":"2026-07-05T08:24:11.750697+00:00"}