{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:GWE46JNG4IKGILY2FEMHCJGEGJ","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":"0a9b90a44a7eee2c8a16d24bb2cdd0725b27d5cc328a621dd5c1340705246615","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-11-29T09:26:14Z","title_canon_sha256":"c738420e9f396cda7de0454d898ff9d31a459b4c0dd034a03cf3b5e2564896a9"},"schema_version":"1.0","source":{"id":"1611.09536","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.09536","created_at":"2026-05-18T00:44:51Z"},{"alias_kind":"arxiv_version","alias_value":"1611.09536v1","created_at":"2026-05-18T00:44:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.09536","created_at":"2026-05-18T00:44:51Z"},{"alias_kind":"pith_short_12","alias_value":"GWE46JNG4IKG","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_16","alias_value":"GWE46JNG4IKGILY2","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_8","alias_value":"GWE46JNG","created_at":"2026-05-18T12:30:19Z"}],"graph_snapshots":[{"event_id":"sha256:199262e00dc1019eaa97b8d07614e3bc9384fe8fb4c1d3c9b864653ce64cc3ff","target":"graph","created_at":"2026-05-18T00:44:51Z","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":"A \\textit{restraint} $r$ on $G$ is a function which assigns each vertex $v$ of $G$ a finite set of forbidden colours $r(v)$. A proper colouring $c$ of $G$ is said to be \\textit{permitted by the restraint r} if $c(v)\\notin r(v)$ for every vertex $v$ of $G$. A restraint $r$ on a graph $G$ with $n$ vertices is called a \\textit{$k$-restraint} if $|r(v)|=k$ and $r(v) \\subseteq \\{1,2,\\dots ,kn\\}$ for every vertex $v$ of $G$. In this article we discuss the following problem: among all $k$-restraints $r$ on $G$, which restraints permit the largest number of $x$-colourings for all large enough $x$? We ","authors_text":"Aysel Erey, Jason Brown","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-11-29T09:26:14Z","title":"Restraints Permitting the Largest Number of Colourings"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.09536","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:6206b79a1aeaa7e8445877fa2bbb781eaed0773854f157ecbf2174d7247888de","target":"record","created_at":"2026-05-18T00:44:51Z","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":"0a9b90a44a7eee2c8a16d24bb2cdd0725b27d5cc328a621dd5c1340705246615","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-11-29T09:26:14Z","title_canon_sha256":"c738420e9f396cda7de0454d898ff9d31a459b4c0dd034a03cf3b5e2564896a9"},"schema_version":"1.0","source":{"id":"1611.09536","kind":"arxiv","version":1}},"canonical_sha256":"3589cf25a6e214642f1a29187124c4326e0d07adfe8a15a7ecff326e50f3a9b3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3589cf25a6e214642f1a29187124c4326e0d07adfe8a15a7ecff326e50f3a9b3","first_computed_at":"2026-05-18T00:44:51.969714Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:44:51.969714Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"pi1SMxNn8GTPBEkeWaoP7sp70VoOVYGgqKt9sIs/9FL0kiFOYUkPdLNrgqyaC931KAYNnei3S0QNwMm5GOSKBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:44:51.970391Z","signed_message":"canonical_sha256_bytes"},"source_id":"1611.09536","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6206b79a1aeaa7e8445877fa2bbb781eaed0773854f157ecbf2174d7247888de","sha256:199262e00dc1019eaa97b8d07614e3bc9384fe8fb4c1d3c9b864653ce64cc3ff"],"state_sha256":"85dfe3c9b255f3eaacfedb242510f7e39bc9491d7a1106d59b3cbaae31b55158"}