{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:VY75GUOS4FW66WSA5OLHWY5KKN","short_pith_number":"pith:VY75GUOS","schema_version":"1.0","canonical_sha256":"ae3fd351d2e16def5a40eb967b63aa53733af250b24b5a96e455663dbfda7453","source":{"kind":"arxiv","id":"1803.01505","version":1},"attestation_state":"computed","paper":{"title":"On Chromatic Core Subgraph of Simple Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.GM","authors_text":"Johan Kok, M. Jerlin Seles, Sudev Naduvath, U. Mary","submitted_at":"2018-03-05T05:48:00Z","abstract_excerpt":"If distinct colours represent distinct technology types that are placed at the vertices of a simple graph in accordance to a minimum proper colouring, a disaster recovery strategy could rely on an answer to the question: \"What is the maximum destruction, if any, the graph (a network) can undergo while ensuring that at least one of each technology type remain, in accordance to a minimum proper colouring of the remaining induced subgraph.\" In this paper, we introduce the notion of a chromatic core subgraph $H$ of a given simple graph $G$ in answer to the stated problem. Since for any subgraph $H"},"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":"1803.01505","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GM","submitted_at":"2018-03-05T05:48:00Z","cross_cats_sorted":[],"title_canon_sha256":"b233e76d8025091baf50292160b0f2688c6eb27332ccaa3fba98337defd71280","abstract_canon_sha256":"0fe9c4a96a008dd1f23c417ed5219736d26f6489779111b7fd9d65b45b4cec98"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:22:00.452842Z","signature_b64":"oVQi1eHZ/2wUS+jmCoJIjSvjRoc7xr+lz78oE8fesVn3e2q7RlB8OsuyOXpp4Aoiim0KKqd49XxlUmIBkPIrDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ae3fd351d2e16def5a40eb967b63aa53733af250b24b5a96e455663dbfda7453","last_reissued_at":"2026-05-18T00:22:00.452221Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:22:00.452221Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Chromatic Core Subgraph of Simple Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.GM","authors_text":"Johan Kok, M. Jerlin Seles, Sudev Naduvath, U. Mary","submitted_at":"2018-03-05T05:48:00Z","abstract_excerpt":"If distinct colours represent distinct technology types that are placed at the vertices of a simple graph in accordance to a minimum proper colouring, a disaster recovery strategy could rely on an answer to the question: \"What is the maximum destruction, if any, the graph (a network) can undergo while ensuring that at least one of each technology type remain, in accordance to a minimum proper colouring of the remaining induced subgraph.\" In this paper, we introduce the notion of a chromatic core subgraph $H$ of a given simple graph $G$ in answer to the stated problem. Since for any subgraph $H"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.01505","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":"1803.01505","created_at":"2026-05-18T00:22:00.452307+00:00"},{"alias_kind":"arxiv_version","alias_value":"1803.01505v1","created_at":"2026-05-18T00:22:00.452307+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.01505","created_at":"2026-05-18T00:22:00.452307+00:00"},{"alias_kind":"pith_short_12","alias_value":"VY75GUOS4FW6","created_at":"2026-05-18T12:32:59.047623+00:00"},{"alias_kind":"pith_short_16","alias_value":"VY75GUOS4FW66WSA","created_at":"2026-05-18T12:32:59.047623+00:00"},{"alias_kind":"pith_short_8","alias_value":"VY75GUOS","created_at":"2026-05-18T12:32:59.047623+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/VY75GUOS4FW66WSA5OLHWY5KKN","json":"https://pith.science/pith/VY75GUOS4FW66WSA5OLHWY5KKN.json","graph_json":"https://pith.science/api/pith-number/VY75GUOS4FW66WSA5OLHWY5KKN/graph.json","events_json":"https://pith.science/api/pith-number/VY75GUOS4FW66WSA5OLHWY5KKN/events.json","paper":"https://pith.science/paper/VY75GUOS"},"agent_actions":{"view_html":"https://pith.science/pith/VY75GUOS4FW66WSA5OLHWY5KKN","download_json":"https://pith.science/pith/VY75GUOS4FW66WSA5OLHWY5KKN.json","view_paper":"https://pith.science/paper/VY75GUOS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1803.01505&json=true","fetch_graph":"https://pith.science/api/pith-number/VY75GUOS4FW66WSA5OLHWY5KKN/graph.json","fetch_events":"https://pith.science/api/pith-number/VY75GUOS4FW66WSA5OLHWY5KKN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VY75GUOS4FW66WSA5OLHWY5KKN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VY75GUOS4FW66WSA5OLHWY5KKN/action/storage_attestation","attest_author":"https://pith.science/pith/VY75GUOS4FW66WSA5OLHWY5KKN/action/author_attestation","sign_citation":"https://pith.science/pith/VY75GUOS4FW66WSA5OLHWY5KKN/action/citation_signature","submit_replication":"https://pith.science/pith/VY75GUOS4FW66WSA5OLHWY5KKN/action/replication_record"}},"created_at":"2026-05-18T00:22:00.452307+00:00","updated_at":"2026-05-18T00:22:00.452307+00:00"}