{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:U2FDWXFE3CYQKDJKF2ECQLKCLJ","short_pith_number":"pith:U2FDWXFE","schema_version":"1.0","canonical_sha256":"a68a3b5ca4d8b1050d2a2e88282d425a4894468736559925a8da3262e03aa547","source":{"kind":"arxiv","id":"1404.6278","version":1},"attestation_state":"computed","paper":{"title":"On Coupon Colorings of Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bob Chen, Jacques Verstraete, Jeong Han Kim, Michael Tait","submitted_at":"2014-04-24T21:45:43Z","abstract_excerpt":"Let $G$ be a graph with no isolated vertices. A {\\em $k$-coupon coloring} of $G$ is an assignment of colors from $[k] := \\{1,2,\\dots,k\\}$ to the vertices of $G$ such that the neighborhood of every vertex of $G$ contains vertices of all colors from $[k]$. The maximum $k$ for which a $k$-coupon coloring exists is called the {\\em coupon coloring number} of $G$, and is denoted $\\chi_{c}(G)$. In this paper, we prove that every $d$-regular graph $G$ has $\\chi_{c}(G) \\geq (1 - o(1))d/\\log d$ as $d \\rightarrow \\infty$, and the proportion of $d$-regular graphs $G$ for which $\\chi_c(G) \\leq (1 + o(1))d/"},"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":"1404.6278","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-04-24T21:45:43Z","cross_cats_sorted":[],"title_canon_sha256":"2c3cf7363365c26314e92a785332dfdf9e73623336dfe9cc1a02af174efdb7b8","abstract_canon_sha256":"6cd5f83f6e6682dc1996ec6a1b6eedf3e84eed2df5a05ae3d9ba8c78222aa76a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:53:16.971261Z","signature_b64":"b87JQMdi4C+8SmggeVs11Ut9WqlJTNp+/tm9hfGETpVByQg06OdhzzABBmDyzHB7AeUMYUpn6VwKC5ESeDB1AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a68a3b5ca4d8b1050d2a2e88282d425a4894468736559925a8da3262e03aa547","last_reissued_at":"2026-05-18T02:53:16.970517Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:53:16.970517Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Coupon Colorings of Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bob Chen, Jacques Verstraete, Jeong Han Kim, Michael Tait","submitted_at":"2014-04-24T21:45:43Z","abstract_excerpt":"Let $G$ be a graph with no isolated vertices. A {\\em $k$-coupon coloring} of $G$ is an assignment of colors from $[k] := \\{1,2,\\dots,k\\}$ to the vertices of $G$ such that the neighborhood of every vertex of $G$ contains vertices of all colors from $[k]$. The maximum $k$ for which a $k$-coupon coloring exists is called the {\\em coupon coloring number} of $G$, and is denoted $\\chi_{c}(G)$. In this paper, we prove that every $d$-regular graph $G$ has $\\chi_{c}(G) \\geq (1 - o(1))d/\\log d$ as $d \\rightarrow \\infty$, and the proportion of $d$-regular graphs $G$ for which $\\chi_c(G) \\leq (1 + o(1))d/"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.6278","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":"1404.6278","created_at":"2026-05-18T02:53:16.970636+00:00"},{"alias_kind":"arxiv_version","alias_value":"1404.6278v1","created_at":"2026-05-18T02:53:16.970636+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.6278","created_at":"2026-05-18T02:53:16.970636+00:00"},{"alias_kind":"pith_short_12","alias_value":"U2FDWXFE3CYQ","created_at":"2026-05-18T12:28:52.271510+00:00"},{"alias_kind":"pith_short_16","alias_value":"U2FDWXFE3CYQKDJK","created_at":"2026-05-18T12:28:52.271510+00:00"},{"alias_kind":"pith_short_8","alias_value":"U2FDWXFE","created_at":"2026-05-18T12:28:52.271510+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/U2FDWXFE3CYQKDJKF2ECQLKCLJ","json":"https://pith.science/pith/U2FDWXFE3CYQKDJKF2ECQLKCLJ.json","graph_json":"https://pith.science/api/pith-number/U2FDWXFE3CYQKDJKF2ECQLKCLJ/graph.json","events_json":"https://pith.science/api/pith-number/U2FDWXFE3CYQKDJKF2ECQLKCLJ/events.json","paper":"https://pith.science/paper/U2FDWXFE"},"agent_actions":{"view_html":"https://pith.science/pith/U2FDWXFE3CYQKDJKF2ECQLKCLJ","download_json":"https://pith.science/pith/U2FDWXFE3CYQKDJKF2ECQLKCLJ.json","view_paper":"https://pith.science/paper/U2FDWXFE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1404.6278&json=true","fetch_graph":"https://pith.science/api/pith-number/U2FDWXFE3CYQKDJKF2ECQLKCLJ/graph.json","fetch_events":"https://pith.science/api/pith-number/U2FDWXFE3CYQKDJKF2ECQLKCLJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/U2FDWXFE3CYQKDJKF2ECQLKCLJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/U2FDWXFE3CYQKDJKF2ECQLKCLJ/action/storage_attestation","attest_author":"https://pith.science/pith/U2FDWXFE3CYQKDJKF2ECQLKCLJ/action/author_attestation","sign_citation":"https://pith.science/pith/U2FDWXFE3CYQKDJKF2ECQLKCLJ/action/citation_signature","submit_replication":"https://pith.science/pith/U2FDWXFE3CYQKDJKF2ECQLKCLJ/action/replication_record"}},"created_at":"2026-05-18T02:53:16.970636+00:00","updated_at":"2026-05-18T02:53:16.970636+00:00"}