{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:QSEVEQQZUZZKY4E33ZNKBUG3LT","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":"c893f5cd657f3915e246ca7a1eb7cda8f894c6d2f33e8e2af835d205bc9e5612","cross_cats_sorted":["math.CO","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-02-11T00:53:50Z","title_canon_sha256":"98ce05dd373cc83ca45913a2d2d84532bc37ebba3f47ce0a6888347714b69430"},"schema_version":"1.0","source":{"id":"1602.03586","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.03586","created_at":"2026-05-18T01:20:58Z"},{"alias_kind":"arxiv_version","alias_value":"1602.03586v1","created_at":"2026-05-18T01:20:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.03586","created_at":"2026-05-18T01:20:58Z"},{"alias_kind":"pith_short_12","alias_value":"QSEVEQQZUZZK","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_16","alias_value":"QSEVEQQZUZZKY4E3","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_8","alias_value":"QSEVEQQZ","created_at":"2026-05-18T12:30:41Z"}],"graph_snapshots":[{"event_id":"sha256:1b3ece34fc4c9ba0e23fc425e87b25f19577264ecf34bb810937ae10b4ef145f","target":"graph","created_at":"2026-05-18T01:20:58Z","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":"For a given number of colours, $s$, the guessing number of a graph is the base $s$ logarithm of the size of the largest family of colourings of the vertex set of the graph such that the colour of each vertex can be determined from the colours of the vertices in its neighbourhood. An upper bound for the guessing number of the $n$-vertex cycle graph $C_n$ is $n/2$. It is known that the guessing number equals $n/2$ whenever $n$ is even or $s$ is a perfect square \\cite{Christofides2011guessing}. We show that, for any given integer $s\\geq 2$, if $a$ is the largest factor of $s$ less than or equal t","authors_text":"Fiona Skerman, Puck Rombach, Ross Atkins","cross_cats":["math.CO","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-02-11T00:53:50Z","title":"Guessing Numbers of Odd Cycles"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.03586","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:c61ee95ba64f34ce9529cf88986566cd6c7ccf9e02bb494811db07c6e872b4ed","target":"record","created_at":"2026-05-18T01:20:58Z","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":"c893f5cd657f3915e246ca7a1eb7cda8f894c6d2f33e8e2af835d205bc9e5612","cross_cats_sorted":["math.CO","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-02-11T00:53:50Z","title_canon_sha256":"98ce05dd373cc83ca45913a2d2d84532bc37ebba3f47ce0a6888347714b69430"},"schema_version":"1.0","source":{"id":"1602.03586","kind":"arxiv","version":1}},"canonical_sha256":"8489524219a672ac709bde5aa0d0db5cc7b14228dcf7f49335fb33aae5b3f4df","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8489524219a672ac709bde5aa0d0db5cc7b14228dcf7f49335fb33aae5b3f4df","first_computed_at":"2026-05-18T01:20:58.435146Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:20:58.435146Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"iTjlbTf5Nu2dVFJ75lSoWXQhTYCZE+r2heZC8pYFxl8FNyqbptp1ZhC9RIuCRazmL70XArgvhqEOxj5+MU5HDA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:20:58.435718Z","signed_message":"canonical_sha256_bytes"},"source_id":"1602.03586","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c61ee95ba64f34ce9529cf88986566cd6c7ccf9e02bb494811db07c6e872b4ed","sha256:1b3ece34fc4c9ba0e23fc425e87b25f19577264ecf34bb810937ae10b4ef145f"],"state_sha256":"f18d30b484debf1cd8b8901660013199517fa3548e5fe6735cc5b3cc9b6b19df"}