{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:GWE46JNG4IKGILY2FEMHCJGEGJ","short_pith_number":"pith:GWE46JNG","schema_version":"1.0","canonical_sha256":"3589cf25a6e214642f1a29187124c4326e0d07adfe8a15a7ecff326e50f3a9b3","source":{"kind":"arxiv","id":"1611.09536","version":1},"attestation_state":"computed","paper":{"title":"Restraints Permitting the Largest Number of Colourings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Aysel Erey, Jason Brown","submitted_at":"2016-11-29T09:26:14Z","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 "},"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":"1611.09536","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-11-29T09:26:14Z","cross_cats_sorted":[],"title_canon_sha256":"c738420e9f396cda7de0454d898ff9d31a459b4c0dd034a03cf3b5e2564896a9","abstract_canon_sha256":"0a9b90a44a7eee2c8a16d24bb2cdd0725b27d5cc328a621dd5c1340705246615"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:44:51.970391Z","signature_b64":"pi1SMxNn8GTPBEkeWaoP7sp70VoOVYGgqKt9sIs/9FL0kiFOYUkPdLNrgqyaC931KAYNnei3S0QNwMm5GOSKBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3589cf25a6e214642f1a29187124c4326e0d07adfe8a15a7ecff326e50f3a9b3","last_reissued_at":"2026-05-18T00:44:51.969714Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:44:51.969714Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Restraints Permitting the Largest Number of Colourings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Aysel Erey, Jason Brown","submitted_at":"2016-11-29T09:26:14Z","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 "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.09536","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":"1611.09536","created_at":"2026-05-18T00:44:51.969835+00:00"},{"alias_kind":"arxiv_version","alias_value":"1611.09536v1","created_at":"2026-05-18T00:44:51.969835+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.09536","created_at":"2026-05-18T00:44:51.969835+00:00"},{"alias_kind":"pith_short_12","alias_value":"GWE46JNG4IKG","created_at":"2026-05-18T12:30:19.053100+00:00"},{"alias_kind":"pith_short_16","alias_value":"GWE46JNG4IKGILY2","created_at":"2026-05-18T12:30:19.053100+00:00"},{"alias_kind":"pith_short_8","alias_value":"GWE46JNG","created_at":"2026-05-18T12:30:19.053100+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/GWE46JNG4IKGILY2FEMHCJGEGJ","json":"https://pith.science/pith/GWE46JNG4IKGILY2FEMHCJGEGJ.json","graph_json":"https://pith.science/api/pith-number/GWE46JNG4IKGILY2FEMHCJGEGJ/graph.json","events_json":"https://pith.science/api/pith-number/GWE46JNG4IKGILY2FEMHCJGEGJ/events.json","paper":"https://pith.science/paper/GWE46JNG"},"agent_actions":{"view_html":"https://pith.science/pith/GWE46JNG4IKGILY2FEMHCJGEGJ","download_json":"https://pith.science/pith/GWE46JNG4IKGILY2FEMHCJGEGJ.json","view_paper":"https://pith.science/paper/GWE46JNG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1611.09536&json=true","fetch_graph":"https://pith.science/api/pith-number/GWE46JNG4IKGILY2FEMHCJGEGJ/graph.json","fetch_events":"https://pith.science/api/pith-number/GWE46JNG4IKGILY2FEMHCJGEGJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GWE46JNG4IKGILY2FEMHCJGEGJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GWE46JNG4IKGILY2FEMHCJGEGJ/action/storage_attestation","attest_author":"https://pith.science/pith/GWE46JNG4IKGILY2FEMHCJGEGJ/action/author_attestation","sign_citation":"https://pith.science/pith/GWE46JNG4IKGILY2FEMHCJGEGJ/action/citation_signature","submit_replication":"https://pith.science/pith/GWE46JNG4IKGILY2FEMHCJGEGJ/action/replication_record"}},"created_at":"2026-05-18T00:44:51.969835+00:00","updated_at":"2026-05-18T00:44:51.969835+00:00"}