{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:PZAS443IKOBZU6PNSFREQ53RPL","short_pith_number":"pith:PZAS443I","canonical_record":{"source":{"id":"1611.08920","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-11-27T22:07:34Z","cross_cats_sorted":[],"title_canon_sha256":"9000cb9fcb6a3b2e90ee244039166bb0d36e79b14a4aa61bd8fa2b459726f5ac","abstract_canon_sha256":"f8a96c5135694b40828868a02e333e8a7a6e825e00ce6c789ba4cebf0cf0670f"},"schema_version":"1.0"},"canonical_sha256":"7e412e736853839a79ed91624877717ae285688a32dd428dc0b8fdf6a93d1dd5","source":{"kind":"arxiv","id":"1611.08920","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.08920","created_at":"2026-05-18T00:56:29Z"},{"alias_kind":"arxiv_version","alias_value":"1611.08920v1","created_at":"2026-05-18T00:56:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.08920","created_at":"2026-05-18T00:56:29Z"},{"alias_kind":"pith_short_12","alias_value":"PZAS443IKOBZ","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_16","alias_value":"PZAS443IKOBZU6PN","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_8","alias_value":"PZAS443I","created_at":"2026-05-18T12:30:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:PZAS443IKOBZU6PNSFREQ53RPL","target":"record","payload":{"canonical_record":{"source":{"id":"1611.08920","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-11-27T22:07:34Z","cross_cats_sorted":[],"title_canon_sha256":"9000cb9fcb6a3b2e90ee244039166bb0d36e79b14a4aa61bd8fa2b459726f5ac","abstract_canon_sha256":"f8a96c5135694b40828868a02e333e8a7a6e825e00ce6c789ba4cebf0cf0670f"},"schema_version":"1.0"},"canonical_sha256":"7e412e736853839a79ed91624877717ae285688a32dd428dc0b8fdf6a93d1dd5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:56:29.829569Z","signature_b64":"/ZYvgJp8QiWoMYC2ra9cZaBdtJzjtrF2PpKqzvdooDzr01g3Tt/hygggzT1iUm4Nn7K81jP9+GFhkU+PE5fEAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7e412e736853839a79ed91624877717ae285688a32dd428dc0b8fdf6a93d1dd5","last_reissued_at":"2026-05-18T00:56:29.828851Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:56:29.828851Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1611.08920","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:56:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TXstENitbjdstdEIGUabeffnqaGnq2r9CYEgGHRLbk8BxnkdzRStFEadztvr1XPhU39RgRclQc3l3Tx7p17hDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T05:32:04.573381Z"},"content_sha256":"ad077a216e11173e91600658421ec19a143e9a74493983aee54c87de0550d60a","schema_version":"1.0","event_id":"sha256:ad077a216e11173e91600658421ec19a143e9a74493983aee54c87de0550d60a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:PZAS443IKOBZU6PNSFREQ53RPL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Extremal Restraints for Graph Colourings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Aysel Erey, Jason I. Brown, Jian Li","submitted_at":"2016-11-27T22:07:34Z","abstract_excerpt":"A {\\em restraint} on a (finite undirected) graph $G = (V,E)$ is a function $r$ on $V$ such that $r(v)$ is a finite subset of ${\\mathbb N}$; a proper vertex colouring $c$ of $G$ is {\\em permitted} by $r$ if $c(v) \\not\\in r(v)$ for all vertices $v$ of $G$ (we think of $r(v)$ as the set of colours {\\em forbidden} at $v$). Given a large number of colors, for restraints $r$ with exactly one colour forbidden at each vertex the smallest number of colorings is permitted when $r$ is a constant function, but the problem of what restraints permit the largest number of colourings is more difficult. We det"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.08920","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:56:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SUc2QkdWe6JSU2hsx/HXpeCD5XY7i+N/k/xMggw2IiUCPQMNntazhJQv8VhYGqSytcoP1OsoSAlcL67S+fLuAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T05:32:04.573851Z"},"content_sha256":"99c2d45f84b9879b5a9b075fc5a2391ddc68f4ed80267bf2fdae5ed854575b45","schema_version":"1.0","event_id":"sha256:99c2d45f84b9879b5a9b075fc5a2391ddc68f4ed80267bf2fdae5ed854575b45"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PZAS443IKOBZU6PNSFREQ53RPL/bundle.json","state_url":"https://pith.science/pith/PZAS443IKOBZU6PNSFREQ53RPL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PZAS443IKOBZU6PNSFREQ53RPL/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-24T05:32:04Z","links":{"resolver":"https://pith.science/pith/PZAS443IKOBZU6PNSFREQ53RPL","bundle":"https://pith.science/pith/PZAS443IKOBZU6PNSFREQ53RPL/bundle.json","state":"https://pith.science/pith/PZAS443IKOBZU6PNSFREQ53RPL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PZAS443IKOBZU6PNSFREQ53RPL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:PZAS443IKOBZU6PNSFREQ53RPL","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":"f8a96c5135694b40828868a02e333e8a7a6e825e00ce6c789ba4cebf0cf0670f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-11-27T22:07:34Z","title_canon_sha256":"9000cb9fcb6a3b2e90ee244039166bb0d36e79b14a4aa61bd8fa2b459726f5ac"},"schema_version":"1.0","source":{"id":"1611.08920","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.08920","created_at":"2026-05-18T00:56:29Z"},{"alias_kind":"arxiv_version","alias_value":"1611.08920v1","created_at":"2026-05-18T00:56:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.08920","created_at":"2026-05-18T00:56:29Z"},{"alias_kind":"pith_short_12","alias_value":"PZAS443IKOBZ","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_16","alias_value":"PZAS443IKOBZU6PN","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_8","alias_value":"PZAS443I","created_at":"2026-05-18T12:30:39Z"}],"graph_snapshots":[{"event_id":"sha256:99c2d45f84b9879b5a9b075fc5a2391ddc68f4ed80267bf2fdae5ed854575b45","target":"graph","created_at":"2026-05-18T00:56:29Z","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 {\\em restraint} on a (finite undirected) graph $G = (V,E)$ is a function $r$ on $V$ such that $r(v)$ is a finite subset of ${\\mathbb N}$; a proper vertex colouring $c$ of $G$ is {\\em permitted} by $r$ if $c(v) \\not\\in r(v)$ for all vertices $v$ of $G$ (we think of $r(v)$ as the set of colours {\\em forbidden} at $v$). Given a large number of colors, for restraints $r$ with exactly one colour forbidden at each vertex the smallest number of colorings is permitted when $r$ is a constant function, but the problem of what restraints permit the largest number of colourings is more difficult. We det","authors_text":"Aysel Erey, Jason I. Brown, Jian Li","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-11-27T22:07:34Z","title":"Extremal Restraints for Graph Colourings"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.08920","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:ad077a216e11173e91600658421ec19a143e9a74493983aee54c87de0550d60a","target":"record","created_at":"2026-05-18T00:56:29Z","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":"f8a96c5135694b40828868a02e333e8a7a6e825e00ce6c789ba4cebf0cf0670f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-11-27T22:07:34Z","title_canon_sha256":"9000cb9fcb6a3b2e90ee244039166bb0d36e79b14a4aa61bd8fa2b459726f5ac"},"schema_version":"1.0","source":{"id":"1611.08920","kind":"arxiv","version":1}},"canonical_sha256":"7e412e736853839a79ed91624877717ae285688a32dd428dc0b8fdf6a93d1dd5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7e412e736853839a79ed91624877717ae285688a32dd428dc0b8fdf6a93d1dd5","first_computed_at":"2026-05-18T00:56:29.828851Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:56:29.828851Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/ZYvgJp8QiWoMYC2ra9cZaBdtJzjtrF2PpKqzvdooDzr01g3Tt/hygggzT1iUm4Nn7K81jP9+GFhkU+PE5fEAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:56:29.829569Z","signed_message":"canonical_sha256_bytes"},"source_id":"1611.08920","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ad077a216e11173e91600658421ec19a143e9a74493983aee54c87de0550d60a","sha256:99c2d45f84b9879b5a9b075fc5a2391ddc68f4ed80267bf2fdae5ed854575b45"],"state_sha256":"48473969c1eaeb1e2b58b608b2bf5a382a9c8632704ef3e6a4072ae7a10c0010"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cF/DRglZBWrO9Mz9bRKJcokn0VzdsJ7YcoU4t477YrEr+F4rbIAEuWvJvjP3WJyszL/s/xmqlyAMJUTubbPSDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T05:32:04.576534Z","bundle_sha256":"67bf25589380e967d522833b65b651ffafe012db7889bcd063a0768bfbfac409"}}