{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:C7J3ZBPFQJ6Q5R4QJQTFZZWCOB","short_pith_number":"pith:C7J3ZBPF","schema_version":"1.0","canonical_sha256":"17d3bc85e5827d0ec7904c265ce6c27060f4b94c7922335ddc60c125daf1085f","source":{"kind":"arxiv","id":"1802.00251","version":1},"attestation_state":"computed","paper":{"title":"On indicated coloring of some classes of graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"M. Gokulnath, P. Francis, S. Francis Raj","submitted_at":"2018-02-01T11:47:25Z","abstract_excerpt":"Indicated coloring is a type of game coloring in which two players collectively color the vertices of a graph in the following way. In each round the first player (Ann) selects a vertex, and then the second player (Ben) colors it properly, using a fixed set of colors. The goal of Ann is to achieve a proper coloring of the whole graph, while Ben is trying to prevent the realization of this project. The smallest number of colors necessary for Ann to win the game on a graph $G$ (regardless of Ben's strategy) is called the indicated chromatic number of $G$, denoted by $\\chi_i(G)$. In this paper, w"},"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":"1802.00251","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-02-01T11:47:25Z","cross_cats_sorted":[],"title_canon_sha256":"09ae6b91ad13d923ecda46c0948df835b96418652e63f9cff79d3341e7bafd0d","abstract_canon_sha256":"5f93c8b8bd404a45564b08e626614ffb79f9874d8cad9cbe3270cd1031e391bc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:24:36.431664Z","signature_b64":"F0qNKXI3tgZyyaLEdPhW6FP8CAcOsNQmzMlgf03IgRwWSKtuOXfee3bkwf6ib4tln10o+WSrK3ocZMnE/Cs0Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"17d3bc85e5827d0ec7904c265ce6c27060f4b94c7922335ddc60c125daf1085f","last_reissued_at":"2026-05-18T00:24:36.431134Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:24:36.431134Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On indicated coloring of some classes of graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"M. Gokulnath, P. Francis, S. Francis Raj","submitted_at":"2018-02-01T11:47:25Z","abstract_excerpt":"Indicated coloring is a type of game coloring in which two players collectively color the vertices of a graph in the following way. In each round the first player (Ann) selects a vertex, and then the second player (Ben) colors it properly, using a fixed set of colors. The goal of Ann is to achieve a proper coloring of the whole graph, while Ben is trying to prevent the realization of this project. The smallest number of colors necessary for Ann to win the game on a graph $G$ (regardless of Ben's strategy) is called the indicated chromatic number of $G$, denoted by $\\chi_i(G)$. In this paper, w"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.00251","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1802.00251","created_at":"2026-05-18T00:24:36.431213+00:00"},{"alias_kind":"arxiv_version","alias_value":"1802.00251v1","created_at":"2026-05-18T00:24:36.431213+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.00251","created_at":"2026-05-18T00:24:36.431213+00:00"},{"alias_kind":"pith_short_12","alias_value":"C7J3ZBPFQJ6Q","created_at":"2026-05-18T12:32:16.446611+00:00"},{"alias_kind":"pith_short_16","alias_value":"C7J3ZBPFQJ6Q5R4Q","created_at":"2026-05-18T12:32:16.446611+00:00"},{"alias_kind":"pith_short_8","alias_value":"C7J3ZBPF","created_at":"2026-05-18T12:32:16.446611+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/C7J3ZBPFQJ6Q5R4QJQTFZZWCOB","json":"https://pith.science/pith/C7J3ZBPFQJ6Q5R4QJQTFZZWCOB.json","graph_json":"https://pith.science/api/pith-number/C7J3ZBPFQJ6Q5R4QJQTFZZWCOB/graph.json","events_json":"https://pith.science/api/pith-number/C7J3ZBPFQJ6Q5R4QJQTFZZWCOB/events.json","paper":"https://pith.science/paper/C7J3ZBPF"},"agent_actions":{"view_html":"https://pith.science/pith/C7J3ZBPFQJ6Q5R4QJQTFZZWCOB","download_json":"https://pith.science/pith/C7J3ZBPFQJ6Q5R4QJQTFZZWCOB.json","view_paper":"https://pith.science/paper/C7J3ZBPF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1802.00251&json=true","fetch_graph":"https://pith.science/api/pith-number/C7J3ZBPFQJ6Q5R4QJQTFZZWCOB/graph.json","fetch_events":"https://pith.science/api/pith-number/C7J3ZBPFQJ6Q5R4QJQTFZZWCOB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/C7J3ZBPFQJ6Q5R4QJQTFZZWCOB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/C7J3ZBPFQJ6Q5R4QJQTFZZWCOB/action/storage_attestation","attest_author":"https://pith.science/pith/C7J3ZBPFQJ6Q5R4QJQTFZZWCOB/action/author_attestation","sign_citation":"https://pith.science/pith/C7J3ZBPFQJ6Q5R4QJQTFZZWCOB/action/citation_signature","submit_replication":"https://pith.science/pith/C7J3ZBPFQJ6Q5R4QJQTFZZWCOB/action/replication_record"}},"created_at":"2026-05-18T00:24:36.431213+00:00","updated_at":"2026-05-18T00:24:36.431213+00:00"}