{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:C7J3ZBPFQJ6Q5R4QJQTFZZWCOB","short_pith_number":"pith:C7J3ZBPF","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"},"canonical_sha256":"17d3bc85e5827d0ec7904c265ce6c27060f4b94c7922335ddc60c125daf1085f","source":{"kind":"arxiv","id":"1802.00251","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.00251","created_at":"2026-05-18T00:24:36Z"},{"alias_kind":"arxiv_version","alias_value":"1802.00251v1","created_at":"2026-05-18T00:24:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.00251","created_at":"2026-05-18T00:24:36Z"},{"alias_kind":"pith_short_12","alias_value":"C7J3ZBPFQJ6Q","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_16","alias_value":"C7J3ZBPFQJ6Q5R4Q","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_8","alias_value":"C7J3ZBPF","created_at":"2026-05-18T12:32:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:C7J3ZBPFQJ6Q5R4QJQTFZZWCOB","target":"record","payload":{"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"},"canonical_sha256":"17d3bc85e5827d0ec7904c265ce6c27060f4b94c7922335ddc60c125daf1085f","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"},"source_kind":"arxiv","source_id":"1802.00251","source_version":1,"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-18T00:24:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rrldnW8IJwEnQ/J5BBUnXKuPr6VSAkYsUulAbvjrTW4MdfyNTr5vMqhVYZpNbp5fKy4zvqmHR3frbBdC+1LjBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T15:07:24.276202Z"},"content_sha256":"52d02bf683a404019e9e535ce53f0ffcd7b48160635bcb6c1283414ccfacc795","schema_version":"1.0","event_id":"sha256:52d02bf683a404019e9e535ce53f0ffcd7b48160635bcb6c1283414ccfacc795"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:C7J3ZBPFQJ6Q5R4QJQTFZZWCOB","target":"graph","payload":{"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"},"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-18T00:24:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GL+os4uGBJKU60HkGnylKfz1FfxAwW1uxe5H5LXrMPe9lxXUaLJGNiasE4Jy0tDQLV8NykM4Tq4PB/dpIeivDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T15:07:24.276580Z"},"content_sha256":"5754ce778fadf39d760ef6d24009f417034ab0606e077e73e3519209ecfeb6d5","schema_version":"1.0","event_id":"sha256:5754ce778fadf39d760ef6d24009f417034ab0606e077e73e3519209ecfeb6d5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/C7J3ZBPFQJ6Q5R4QJQTFZZWCOB/bundle.json","state_url":"https://pith.science/pith/C7J3ZBPFQJ6Q5R4QJQTFZZWCOB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/C7J3ZBPFQJ6Q5R4QJQTFZZWCOB/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-06-04T15:07:24Z","links":{"resolver":"https://pith.science/pith/C7J3ZBPFQJ6Q5R4QJQTFZZWCOB","bundle":"https://pith.science/pith/C7J3ZBPFQJ6Q5R4QJQTFZZWCOB/bundle.json","state":"https://pith.science/pith/C7J3ZBPFQJ6Q5R4QJQTFZZWCOB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/C7J3ZBPFQJ6Q5R4QJQTFZZWCOB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:C7J3ZBPFQJ6Q5R4QJQTFZZWCOB","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":"5f93c8b8bd404a45564b08e626614ffb79f9874d8cad9cbe3270cd1031e391bc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-02-01T11:47:25Z","title_canon_sha256":"09ae6b91ad13d923ecda46c0948df835b96418652e63f9cff79d3341e7bafd0d"},"schema_version":"1.0","source":{"id":"1802.00251","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.00251","created_at":"2026-05-18T00:24:36Z"},{"alias_kind":"arxiv_version","alias_value":"1802.00251v1","created_at":"2026-05-18T00:24:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.00251","created_at":"2026-05-18T00:24:36Z"},{"alias_kind":"pith_short_12","alias_value":"C7J3ZBPFQJ6Q","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_16","alias_value":"C7J3ZBPFQJ6Q5R4Q","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_8","alias_value":"C7J3ZBPF","created_at":"2026-05-18T12:32:16Z"}],"graph_snapshots":[{"event_id":"sha256:5754ce778fadf39d760ef6d24009f417034ab0606e077e73e3519209ecfeb6d5","target":"graph","created_at":"2026-05-18T00:24:36Z","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":"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","authors_text":"M. Gokulnath, P. Francis, S. Francis Raj","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-02-01T11:47:25Z","title":"On indicated coloring of some classes of graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.00251","kind":"arxiv","version":1},"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:52d02bf683a404019e9e535ce53f0ffcd7b48160635bcb6c1283414ccfacc795","target":"record","created_at":"2026-05-18T00:24:36Z","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":"5f93c8b8bd404a45564b08e626614ffb79f9874d8cad9cbe3270cd1031e391bc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-02-01T11:47:25Z","title_canon_sha256":"09ae6b91ad13d923ecda46c0948df835b96418652e63f9cff79d3341e7bafd0d"},"schema_version":"1.0","source":{"id":"1802.00251","kind":"arxiv","version":1}},"canonical_sha256":"17d3bc85e5827d0ec7904c265ce6c27060f4b94c7922335ddc60c125daf1085f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"17d3bc85e5827d0ec7904c265ce6c27060f4b94c7922335ddc60c125daf1085f","first_computed_at":"2026-05-18T00:24:36.431134Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:24:36.431134Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"F0qNKXI3tgZyyaLEdPhW6FP8CAcOsNQmzMlgf03IgRwWSKtuOXfee3bkwf6ib4tln10o+WSrK3ocZMnE/Cs0Dg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:24:36.431664Z","signed_message":"canonical_sha256_bytes"},"source_id":"1802.00251","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:52d02bf683a404019e9e535ce53f0ffcd7b48160635bcb6c1283414ccfacc795","sha256:5754ce778fadf39d760ef6d24009f417034ab0606e077e73e3519209ecfeb6d5"],"state_sha256":"a5662712cd1b2fc178f5d1a6cc4be1b18e9c2e528bdecc54171a22e9857ea4b4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RIGHgMP0vyk6RmM/pzJBD2EtlBgRHbxit8l07B7YWIdCeWx1njNBdir8ZEAmXPZhbecmhb4r/nFpx2EdnHdWAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T15:07:24.278990Z","bundle_sha256":"34074c6f931703725ac958af8dafcf72a915e7af0cfad145bf7dafc714668346"}}