{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:SYPM3SPER57VWBAYRVH6HFSKQX","short_pith_number":"pith:SYPM3SPE","schema_version":"1.0","canonical_sha256":"961ecdc9e48f7f5b04188d4fe3964a85d9687b7d4841db3709ecf16d71528ae5","source":{"kind":"arxiv","id":"1708.09798","version":2},"attestation_state":"computed","paper":{"title":"On J-Colorability of Certain Derived Graph Classes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.GM","authors_text":"Federico Fornasiero, Sudev Naduvath","submitted_at":"2017-08-09T20:23:29Z","abstract_excerpt":"A vertex $v$ of a given graph $G$ is said to be in a rainbow neighbourhood of $G$, with respect to a proper coloring $C$ of $G$, if the closed neighbourhood $N[v]$ of the vertex $v$ consists of at least one vertex from every colour class of $G$ with respect to $C$. A maximal proper colouring of a graph $G$ is a $J$-colouring of $G$ if and only if every vertex of G belongs to a rainbow neighbourhood of $G$. In this paper, we study certain parameters related to $J$-colouring of certain Mycielski type 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":"1708.09798","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GM","submitted_at":"2017-08-09T20:23:29Z","cross_cats_sorted":[],"title_canon_sha256":"f7698ba2eb669fb17349289660212ee70b882b69f42fe734340aa6a43caae93b","abstract_canon_sha256":"bdee89a7c4aa6f4d3b00769d28233e650a14181e474ebd3d252a18e7a10ff191"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:36:08.112469Z","signature_b64":"DVn4HW8Wk9TBsNdGjPUmsAEJ9kFnQWVGwmZI7MduGpCFyiqz0FoGb7YApex7V3Je28Mn1ynWTK11gqDpl4RUCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"961ecdc9e48f7f5b04188d4fe3964a85d9687b7d4841db3709ecf16d71528ae5","last_reissued_at":"2026-05-18T00:36:08.111905Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:36:08.111905Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On J-Colorability of Certain Derived Graph Classes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.GM","authors_text":"Federico Fornasiero, Sudev Naduvath","submitted_at":"2017-08-09T20:23:29Z","abstract_excerpt":"A vertex $v$ of a given graph $G$ is said to be in a rainbow neighbourhood of $G$, with respect to a proper coloring $C$ of $G$, if the closed neighbourhood $N[v]$ of the vertex $v$ consists of at least one vertex from every colour class of $G$ with respect to $C$. A maximal proper colouring of a graph $G$ is a $J$-colouring of $G$ if and only if every vertex of G belongs to a rainbow neighbourhood of $G$. In this paper, we study certain parameters related to $J$-colouring of certain Mycielski type graphs."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.09798","kind":"arxiv","version":2},"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":"1708.09798","created_at":"2026-05-18T00:36:08.111998+00:00"},{"alias_kind":"arxiv_version","alias_value":"1708.09798v2","created_at":"2026-05-18T00:36:08.111998+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.09798","created_at":"2026-05-18T00:36:08.111998+00:00"},{"alias_kind":"pith_short_12","alias_value":"SYPM3SPER57V","created_at":"2026-05-18T12:31:43.269735+00:00"},{"alias_kind":"pith_short_16","alias_value":"SYPM3SPER57VWBAY","created_at":"2026-05-18T12:31:43.269735+00:00"},{"alias_kind":"pith_short_8","alias_value":"SYPM3SPE","created_at":"2026-05-18T12:31:43.269735+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/SYPM3SPER57VWBAYRVH6HFSKQX","json":"https://pith.science/pith/SYPM3SPER57VWBAYRVH6HFSKQX.json","graph_json":"https://pith.science/api/pith-number/SYPM3SPER57VWBAYRVH6HFSKQX/graph.json","events_json":"https://pith.science/api/pith-number/SYPM3SPER57VWBAYRVH6HFSKQX/events.json","paper":"https://pith.science/paper/SYPM3SPE"},"agent_actions":{"view_html":"https://pith.science/pith/SYPM3SPER57VWBAYRVH6HFSKQX","download_json":"https://pith.science/pith/SYPM3SPER57VWBAYRVH6HFSKQX.json","view_paper":"https://pith.science/paper/SYPM3SPE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1708.09798&json=true","fetch_graph":"https://pith.science/api/pith-number/SYPM3SPER57VWBAYRVH6HFSKQX/graph.json","fetch_events":"https://pith.science/api/pith-number/SYPM3SPER57VWBAYRVH6HFSKQX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SYPM3SPER57VWBAYRVH6HFSKQX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SYPM3SPER57VWBAYRVH6HFSKQX/action/storage_attestation","attest_author":"https://pith.science/pith/SYPM3SPER57VWBAYRVH6HFSKQX/action/author_attestation","sign_citation":"https://pith.science/pith/SYPM3SPER57VWBAYRVH6HFSKQX/action/citation_signature","submit_replication":"https://pith.science/pith/SYPM3SPER57VWBAYRVH6HFSKQX/action/replication_record"}},"created_at":"2026-05-18T00:36:08.111998+00:00","updated_at":"2026-05-18T00:36:08.111998+00:00"}