{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:LOT6EGYKZWGUWS6ENGLS6BYTHP","short_pith_number":"pith:LOT6EGYK","schema_version":"1.0","canonical_sha256":"5ba7e21b0acd8d4b4bc469972f07133bea3e241c0999bc6b9d65e7572534043e","source":{"kind":"arxiv","id":"1808.08661","version":1},"attestation_state":"computed","paper":{"title":"On $J$-Colouring of Chithra Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.GM","authors_text":"Johan Kok, Sudev Naduvath","submitted_at":"2018-08-27T01:43:25Z","abstract_excerpt":"The family of Chithra graphs is a wide ranging family of graphs which includes any graph of size at least one. Chithra graphs serve as a graph theoretical model for genetic engineering techniques or for modelling natural mutation within various biological networks found in living systems. In this paper, we discuss recently introduced $J$-colouring of the family of Chithra graphs."},"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":"1808.08661","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GM","submitted_at":"2018-08-27T01:43:25Z","cross_cats_sorted":[],"title_canon_sha256":"5ad277be1f114a81717715fc42aa063d48ea03e5d797fed2d29bbbe2e8a3531c","abstract_canon_sha256":"ac165853b27b82d9921ed85e01705459d6b25dc1d2b8fb44753509e8942b31b8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:07:13.653070Z","signature_b64":"mzZR8+0ed50/vgzjhQgCMrcoMwf8g3zIacb72iaUikincQXS7MPRLgprMJ35ehn6LnRHZUzGZqVje+RZUyWTDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5ba7e21b0acd8d4b4bc469972f07133bea3e241c0999bc6b9d65e7572534043e","last_reissued_at":"2026-05-18T00:07:13.652413Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:07:13.652413Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On $J$-Colouring of Chithra Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.GM","authors_text":"Johan Kok, Sudev Naduvath","submitted_at":"2018-08-27T01:43:25Z","abstract_excerpt":"The family of Chithra graphs is a wide ranging family of graphs which includes any graph of size at least one. Chithra graphs serve as a graph theoretical model for genetic engineering techniques or for modelling natural mutation within various biological networks found in living systems. In this paper, we discuss recently introduced $J$-colouring of the family of Chithra graphs."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.08661","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":"1808.08661","created_at":"2026-05-18T00:07:13.652518+00:00"},{"alias_kind":"arxiv_version","alias_value":"1808.08661v1","created_at":"2026-05-18T00:07:13.652518+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.08661","created_at":"2026-05-18T00:07:13.652518+00:00"},{"alias_kind":"pith_short_12","alias_value":"LOT6EGYKZWGU","created_at":"2026-05-18T12:32:37.024351+00:00"},{"alias_kind":"pith_short_16","alias_value":"LOT6EGYKZWGUWS6E","created_at":"2026-05-18T12:32:37.024351+00:00"},{"alias_kind":"pith_short_8","alias_value":"LOT6EGYK","created_at":"2026-05-18T12:32:37.024351+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/LOT6EGYKZWGUWS6ENGLS6BYTHP","json":"https://pith.science/pith/LOT6EGYKZWGUWS6ENGLS6BYTHP.json","graph_json":"https://pith.science/api/pith-number/LOT6EGYKZWGUWS6ENGLS6BYTHP/graph.json","events_json":"https://pith.science/api/pith-number/LOT6EGYKZWGUWS6ENGLS6BYTHP/events.json","paper":"https://pith.science/paper/LOT6EGYK"},"agent_actions":{"view_html":"https://pith.science/pith/LOT6EGYKZWGUWS6ENGLS6BYTHP","download_json":"https://pith.science/pith/LOT6EGYKZWGUWS6ENGLS6BYTHP.json","view_paper":"https://pith.science/paper/LOT6EGYK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1808.08661&json=true","fetch_graph":"https://pith.science/api/pith-number/LOT6EGYKZWGUWS6ENGLS6BYTHP/graph.json","fetch_events":"https://pith.science/api/pith-number/LOT6EGYKZWGUWS6ENGLS6BYTHP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LOT6EGYKZWGUWS6ENGLS6BYTHP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LOT6EGYKZWGUWS6ENGLS6BYTHP/action/storage_attestation","attest_author":"https://pith.science/pith/LOT6EGYKZWGUWS6ENGLS6BYTHP/action/author_attestation","sign_citation":"https://pith.science/pith/LOT6EGYKZWGUWS6ENGLS6BYTHP/action/citation_signature","submit_replication":"https://pith.science/pith/LOT6EGYKZWGUWS6ENGLS6BYTHP/action/replication_record"}},"created_at":"2026-05-18T00:07:13.652518+00:00","updated_at":"2026-05-18T00:07:13.652518+00:00"}