{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:NXFJJZLT4VNI5JPJMX44E66FU3","short_pith_number":"pith:NXFJJZLT","schema_version":"1.0","canonical_sha256":"6dca94e573e55a8ea5e965f9c27bc5a6cc60886175731a2f577942a484832f53","source":{"kind":"arxiv","id":"1604.07128","version":2},"attestation_state":"computed","paper":{"title":"On the Grundy number of Cameron graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DM","authors_text":"Fu-Hong Liu, Hsiang-Hsuan Liu, Tao-Ming Wang, Ton Kloks, Wing-Kai Hon","submitted_at":"2016-04-25T04:41:43Z","abstract_excerpt":"The Grundy number of a graph is the maximal number of colors attained by a first-fit coloring of the graph. The class of Cameron graphs is the Seidel switching class of cographs. In this paper we show that the Grundy number is computable in polynomial time for Cameron 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":"1604.07128","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-04-25T04:41:43Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"227c8fd5340987abdbc02d90748769fd151e8f5eef6c58156236f1b2fcb538c7","abstract_canon_sha256":"43f972cb824ac9b04a05e31d6de172afedd684c56a496f8ffcbbc34a45364ac4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:11:04.757413Z","signature_b64":"oQ+SSimdSIsKXYdugidOw1SlUT8VULrwkI4g+pTQaLuZRHh88TntiVkwYfYZB1/Gle+udAC+hbzhAHATpgbjDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6dca94e573e55a8ea5e965f9c27bc5a6cc60886175731a2f577942a484832f53","last_reissued_at":"2026-05-18T01:11:04.756986Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:11:04.756986Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Grundy number of Cameron graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DM","authors_text":"Fu-Hong Liu, Hsiang-Hsuan Liu, Tao-Ming Wang, Ton Kloks, Wing-Kai Hon","submitted_at":"2016-04-25T04:41:43Z","abstract_excerpt":"The Grundy number of a graph is the maximal number of colors attained by a first-fit coloring of the graph. The class of Cameron graphs is the Seidel switching class of cographs. In this paper we show that the Grundy number is computable in polynomial time for Cameron graphs."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.07128","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":"1604.07128","created_at":"2026-05-18T01:11:04.757047+00:00"},{"alias_kind":"arxiv_version","alias_value":"1604.07128v2","created_at":"2026-05-18T01:11:04.757047+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.07128","created_at":"2026-05-18T01:11:04.757047+00:00"},{"alias_kind":"pith_short_12","alias_value":"NXFJJZLT4VNI","created_at":"2026-05-18T12:30:36.002864+00:00"},{"alias_kind":"pith_short_16","alias_value":"NXFJJZLT4VNI5JPJ","created_at":"2026-05-18T12:30:36.002864+00:00"},{"alias_kind":"pith_short_8","alias_value":"NXFJJZLT","created_at":"2026-05-18T12:30:36.002864+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/NXFJJZLT4VNI5JPJMX44E66FU3","json":"https://pith.science/pith/NXFJJZLT4VNI5JPJMX44E66FU3.json","graph_json":"https://pith.science/api/pith-number/NXFJJZLT4VNI5JPJMX44E66FU3/graph.json","events_json":"https://pith.science/api/pith-number/NXFJJZLT4VNI5JPJMX44E66FU3/events.json","paper":"https://pith.science/paper/NXFJJZLT"},"agent_actions":{"view_html":"https://pith.science/pith/NXFJJZLT4VNI5JPJMX44E66FU3","download_json":"https://pith.science/pith/NXFJJZLT4VNI5JPJMX44E66FU3.json","view_paper":"https://pith.science/paper/NXFJJZLT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1604.07128&json=true","fetch_graph":"https://pith.science/api/pith-number/NXFJJZLT4VNI5JPJMX44E66FU3/graph.json","fetch_events":"https://pith.science/api/pith-number/NXFJJZLT4VNI5JPJMX44E66FU3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NXFJJZLT4VNI5JPJMX44E66FU3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NXFJJZLT4VNI5JPJMX44E66FU3/action/storage_attestation","attest_author":"https://pith.science/pith/NXFJJZLT4VNI5JPJMX44E66FU3/action/author_attestation","sign_citation":"https://pith.science/pith/NXFJJZLT4VNI5JPJMX44E66FU3/action/citation_signature","submit_replication":"https://pith.science/pith/NXFJJZLT4VNI5JPJMX44E66FU3/action/replication_record"}},"created_at":"2026-05-18T01:11:04.757047+00:00","updated_at":"2026-05-18T01:11:04.757047+00:00"}