{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:2Y3JXFMYXCA3AKYLRX6E6IDFNX","short_pith_number":"pith:2Y3JXFMY","schema_version":"1.0","canonical_sha256":"d6369b9598b881b02b0b8dfc4f20656dcf85328755d021686eb595fd35c187ef","source":{"kind":"arxiv","id":"2606.11757","version":1},"attestation_state":"computed","paper":{"title":"Vertex-critical co-gem-free graphs","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Manoj Belavadi, T. Karthick","submitted_at":"2026-06-10T07:31:54Z","abstract_excerpt":"A graph $G$ is $k$-$colorable$ if $V(G)$ can be partitioned into at most $k$ stable sets. A graph $G$ is $k$-$chromatic$ if $k$ is the smallest integer for which $G$ is $k$-colorable. In general, for a fixed $k\\ge 3$, determining whether an arbitrary graph $G$ is $k$-colorable is NP-complete. Consequently, $k$-coloring algorithms for restricted graph classes, such as $\\mathcal{H}$-free graphs, have been widely studied over the past few decades. A graph $G$ is $k$-$vertex$-$critical$ if $G$ is $k$-chromatic and every proper induced subgraph of $G$ is ($k$-1)-colorable. Given a graph $G$, most o"},"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":"2606.11757","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.CO","submitted_at":"2026-06-10T07:31:54Z","cross_cats_sorted":[],"title_canon_sha256":"f6b86243db185c5c6cdfa9af0343cf97550432a5d3c70bbb38d8cc2be49ad0f2","abstract_canon_sha256":"6a01a08e05160878ca07eaafcaca72dc3dac588cf481c4a723eabd8ec4b86a49"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-11T01:10:06.390328Z","signature_b64":"jNSlQVOdEcH1GDbUpmRVjZvlf+P/Q51p09rH8VLNdzfGFdqmaxIZaVlSK8XXDqz9r6IrTxjsJEYjOJ9BcQ0nCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d6369b9598b881b02b0b8dfc4f20656dcf85328755d021686eb595fd35c187ef","last_reissued_at":"2026-06-11T01:10:06.389536Z","signature_status":"signed_v1","first_computed_at":"2026-06-11T01:10:06.389536Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Vertex-critical co-gem-free graphs","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Manoj Belavadi, T. Karthick","submitted_at":"2026-06-10T07:31:54Z","abstract_excerpt":"A graph $G$ is $k$-$colorable$ if $V(G)$ can be partitioned into at most $k$ stable sets. A graph $G$ is $k$-$chromatic$ if $k$ is the smallest integer for which $G$ is $k$-colorable. In general, for a fixed $k\\ge 3$, determining whether an arbitrary graph $G$ is $k$-colorable is NP-complete. Consequently, $k$-coloring algorithms for restricted graph classes, such as $\\mathcal{H}$-free graphs, have been widely studied over the past few decades. A graph $G$ is $k$-$vertex$-$critical$ if $G$ is $k$-chromatic and every proper induced subgraph of $G$ is ($k$-1)-colorable. Given a graph $G$, most o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.11757","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/2606.11757/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":"2606.11757","created_at":"2026-06-11T01:10:06.389669+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.11757v1","created_at":"2026-06-11T01:10:06.389669+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.11757","created_at":"2026-06-11T01:10:06.389669+00:00"},{"alias_kind":"pith_short_12","alias_value":"2Y3JXFMYXCA3","created_at":"2026-06-11T01:10:06.389669+00:00"},{"alias_kind":"pith_short_16","alias_value":"2Y3JXFMYXCA3AKYL","created_at":"2026-06-11T01:10:06.389669+00:00"},{"alias_kind":"pith_short_8","alias_value":"2Y3JXFMY","created_at":"2026-06-11T01:10:06.389669+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/2Y3JXFMYXCA3AKYLRX6E6IDFNX","json":"https://pith.science/pith/2Y3JXFMYXCA3AKYLRX6E6IDFNX.json","graph_json":"https://pith.science/api/pith-number/2Y3JXFMYXCA3AKYLRX6E6IDFNX/graph.json","events_json":"https://pith.science/api/pith-number/2Y3JXFMYXCA3AKYLRX6E6IDFNX/events.json","paper":"https://pith.science/paper/2Y3JXFMY"},"agent_actions":{"view_html":"https://pith.science/pith/2Y3JXFMYXCA3AKYLRX6E6IDFNX","download_json":"https://pith.science/pith/2Y3JXFMYXCA3AKYLRX6E6IDFNX.json","view_paper":"https://pith.science/paper/2Y3JXFMY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.11757&json=true","fetch_graph":"https://pith.science/api/pith-number/2Y3JXFMYXCA3AKYLRX6E6IDFNX/graph.json","fetch_events":"https://pith.science/api/pith-number/2Y3JXFMYXCA3AKYLRX6E6IDFNX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2Y3JXFMYXCA3AKYLRX6E6IDFNX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2Y3JXFMYXCA3AKYLRX6E6IDFNX/action/storage_attestation","attest_author":"https://pith.science/pith/2Y3JXFMYXCA3AKYLRX6E6IDFNX/action/author_attestation","sign_citation":"https://pith.science/pith/2Y3JXFMYXCA3AKYLRX6E6IDFNX/action/citation_signature","submit_replication":"https://pith.science/pith/2Y3JXFMYXCA3AKYLRX6E6IDFNX/action/replication_record"}},"created_at":"2026-06-11T01:10:06.389669+00:00","updated_at":"2026-06-11T01:10:06.389669+00:00"}