{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:DQJY4CHKEOSII5R56VRUWPMGJH","short_pith_number":"pith:DQJY4CHK","schema_version":"1.0","canonical_sha256":"1c138e08ea23a484763df5634b3d8649e710db8851bd332bfbe82cd42b597464","source":{"kind":"arxiv","id":"1707.03132","version":2},"attestation_state":"computed","paper":{"title":"Coloring Chains for Compression with Uncertain Priors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Noah Golowich","submitted_at":"2017-07-11T05:12:08Z","abstract_excerpt":"Haramaty and Sudan considered the problem of transmitting a message between two people, Alice and Bob, when Alice's and Bob's priors on the message are allowed to differ by at most a given factor. To find a deterministic compression scheme for this problem, they showed that it is sufficient to obtain an upper bound on the chromatic number of a graph, denoted $U(N,s,k)$ for parameters $N,s,k$, whose vertices are nested sequences of subsets and whose edges are between vertices that have similar sequences of sets. In turn, there is a close relationship between the problem of determining the chrom"},"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":"1707.03132","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-07-11T05:12:08Z","cross_cats_sorted":[],"title_canon_sha256":"a1d997a70a292e209d48e6125c59eb21685750ae8ca2ecfd13a7e54832e3658a","abstract_canon_sha256":"292ba4de4de1a78257008f6d68194fdb2b7dd93d212e3e574337d6582ade7a4d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:02:45.671682Z","signature_b64":"Lb5G3Je7hNCSW+/YfCfzuv6F8maIH8djAIysKPsYXdxKQ1ikx4QUJPs63Kqwjc7TorUF6R5BXxihUr3x3PE0BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1c138e08ea23a484763df5634b3d8649e710db8851bd332bfbe82cd42b597464","last_reissued_at":"2026-05-18T00:02:45.671123Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:02:45.671123Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Coloring Chains for Compression with Uncertain Priors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Noah Golowich","submitted_at":"2017-07-11T05:12:08Z","abstract_excerpt":"Haramaty and Sudan considered the problem of transmitting a message between two people, Alice and Bob, when Alice's and Bob's priors on the message are allowed to differ by at most a given factor. To find a deterministic compression scheme for this problem, they showed that it is sufficient to obtain an upper bound on the chromatic number of a graph, denoted $U(N,s,k)$ for parameters $N,s,k$, whose vertices are nested sequences of subsets and whose edges are between vertices that have similar sequences of sets. In turn, there is a close relationship between the problem of determining the chrom"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.03132","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":"1707.03132","created_at":"2026-05-18T00:02:45.671196+00:00"},{"alias_kind":"arxiv_version","alias_value":"1707.03132v2","created_at":"2026-05-18T00:02:45.671196+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.03132","created_at":"2026-05-18T00:02:45.671196+00:00"},{"alias_kind":"pith_short_12","alias_value":"DQJY4CHKEOSI","created_at":"2026-05-18T12:31:12.930513+00:00"},{"alias_kind":"pith_short_16","alias_value":"DQJY4CHKEOSII5R5","created_at":"2026-05-18T12:31:12.930513+00:00"},{"alias_kind":"pith_short_8","alias_value":"DQJY4CHK","created_at":"2026-05-18T12:31:12.930513+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/DQJY4CHKEOSII5R56VRUWPMGJH","json":"https://pith.science/pith/DQJY4CHKEOSII5R56VRUWPMGJH.json","graph_json":"https://pith.science/api/pith-number/DQJY4CHKEOSII5R56VRUWPMGJH/graph.json","events_json":"https://pith.science/api/pith-number/DQJY4CHKEOSII5R56VRUWPMGJH/events.json","paper":"https://pith.science/paper/DQJY4CHK"},"agent_actions":{"view_html":"https://pith.science/pith/DQJY4CHKEOSII5R56VRUWPMGJH","download_json":"https://pith.science/pith/DQJY4CHKEOSII5R56VRUWPMGJH.json","view_paper":"https://pith.science/paper/DQJY4CHK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1707.03132&json=true","fetch_graph":"https://pith.science/api/pith-number/DQJY4CHKEOSII5R56VRUWPMGJH/graph.json","fetch_events":"https://pith.science/api/pith-number/DQJY4CHKEOSII5R56VRUWPMGJH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DQJY4CHKEOSII5R56VRUWPMGJH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DQJY4CHKEOSII5R56VRUWPMGJH/action/storage_attestation","attest_author":"https://pith.science/pith/DQJY4CHKEOSII5R56VRUWPMGJH/action/author_attestation","sign_citation":"https://pith.science/pith/DQJY4CHKEOSII5R56VRUWPMGJH/action/citation_signature","submit_replication":"https://pith.science/pith/DQJY4CHKEOSII5R56VRUWPMGJH/action/replication_record"}},"created_at":"2026-05-18T00:02:45.671196+00:00","updated_at":"2026-05-18T00:02:45.671196+00:00"}