{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2009:VXYVIWZOILPSTR33VJ2PDZNABF","short_pith_number":"pith:VXYVIWZO","canonical_record":{"source":{"id":"0910.3815","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2009-10-20T11:42:58Z","cross_cats_sorted":["math.NT"],"title_canon_sha256":"e5c2f83b4a265a1c00cb3ccf80e0d36e760bf90ab91a9308dc49df4055154c60","abstract_canon_sha256":"1371d759a8ce80d4c26d239398f22b32fd644bc4d78f06395e956116562a10ba"},"schema_version":"1.0"},"canonical_sha256":"adf1545b2e42df29c77baa74f1e5a00973a14c7e19cf72300c0d6ecde0cdc533","source":{"kind":"arxiv","id":"0910.3815","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0910.3815","created_at":"2026-05-18T04:23:03Z"},{"alias_kind":"arxiv_version","alias_value":"0910.3815v2","created_at":"2026-05-18T04:23:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0910.3815","created_at":"2026-05-18T04:23:03Z"},{"alias_kind":"pith_short_12","alias_value":"VXYVIWZOILPS","created_at":"2026-05-18T12:26:02Z"},{"alias_kind":"pith_short_16","alias_value":"VXYVIWZOILPSTR33","created_at":"2026-05-18T12:26:02Z"},{"alias_kind":"pith_short_8","alias_value":"VXYVIWZO","created_at":"2026-05-18T12:26:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2009:VXYVIWZOILPSTR33VJ2PDZNABF","target":"record","payload":{"canonical_record":{"source":{"id":"0910.3815","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2009-10-20T11:42:58Z","cross_cats_sorted":["math.NT"],"title_canon_sha256":"e5c2f83b4a265a1c00cb3ccf80e0d36e760bf90ab91a9308dc49df4055154c60","abstract_canon_sha256":"1371d759a8ce80d4c26d239398f22b32fd644bc4d78f06395e956116562a10ba"},"schema_version":"1.0"},"canonical_sha256":"adf1545b2e42df29c77baa74f1e5a00973a14c7e19cf72300c0d6ecde0cdc533","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:23:03.252028Z","signature_b64":"94qzqST3zvluNNB9jz5FwXTPjXLHXcn5GmsadCos01bNWqhtmUWpByu9lOU7a1VfDaK+nWygr+KxBybg4k4bDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"adf1545b2e42df29c77baa74f1e5a00973a14c7e19cf72300c0d6ecde0cdc533","last_reissued_at":"2026-05-18T04:23:03.251387Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:23:03.251387Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0910.3815","source_version":2,"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-18T04:23:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+CTd+HgmsbLgV1kzUH9wqbcJ/SUZGKTFWD+wqL1LBACaK+Xpcl1odP0i2NzEe77MKbqvFb6dyjRzfHeqG2ooDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T17:57:57.055820Z"},"content_sha256":"c1f1f1c2dbbcd6d4fac77eaf996dca52ecf0478f097f3b43a53470089b55ac26","schema_version":"1.0","event_id":"sha256:c1f1f1c2dbbcd6d4fac77eaf996dca52ecf0478f097f3b43a53470089b55ac26"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2009:VXYVIWZOILPSTR33VJ2PDZNABF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On covering by translates of a set","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.NT"],"primary_cat":"math.CO","authors_text":"Bela Bollobas, Oliver Riordan, Svante Janson","submitted_at":"2009-10-20T11:42:58Z","abstract_excerpt":"In this paper we study the minimal number of translates of an arbitrary subset $S$ of a group $G$ needed to cover the group, and related notions of the efficiency of such coverings. We focus mainly on finite subsets in discrete groups, reviewing the classical results in this area, and generalizing them to a much broader context. For example, we show that while the worst-case efficiency when $S$ has $k$ elements is of order $1/\\log k$, for $k$ fixed and $n$ large, almost every $k$-subset of any given $n$-element group covers $G$ with close to optimal efficiency."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0910.3815","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"},"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-18T04:23:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XOxng7ecpIXx+bbkmgOIu+KKUSopw78i2DtUwKlLb28iKoPBZu+4m1aB0MxjZqAGa1Ey3Pr/JmtYY3O63RPVAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T17:57:57.056492Z"},"content_sha256":"db03a387aaaac2a60c0dafa8eca280022f1e8c63af9964a241286ce764350f2c","schema_version":"1.0","event_id":"sha256:db03a387aaaac2a60c0dafa8eca280022f1e8c63af9964a241286ce764350f2c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VXYVIWZOILPSTR33VJ2PDZNABF/bundle.json","state_url":"https://pith.science/pith/VXYVIWZOILPSTR33VJ2PDZNABF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VXYVIWZOILPSTR33VJ2PDZNABF/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-05-25T17:57:57Z","links":{"resolver":"https://pith.science/pith/VXYVIWZOILPSTR33VJ2PDZNABF","bundle":"https://pith.science/pith/VXYVIWZOILPSTR33VJ2PDZNABF/bundle.json","state":"https://pith.science/pith/VXYVIWZOILPSTR33VJ2PDZNABF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VXYVIWZOILPSTR33VJ2PDZNABF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2009:VXYVIWZOILPSTR33VJ2PDZNABF","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":"1371d759a8ce80d4c26d239398f22b32fd644bc4d78f06395e956116562a10ba","cross_cats_sorted":["math.NT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2009-10-20T11:42:58Z","title_canon_sha256":"e5c2f83b4a265a1c00cb3ccf80e0d36e760bf90ab91a9308dc49df4055154c60"},"schema_version":"1.0","source":{"id":"0910.3815","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0910.3815","created_at":"2026-05-18T04:23:03Z"},{"alias_kind":"arxiv_version","alias_value":"0910.3815v2","created_at":"2026-05-18T04:23:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0910.3815","created_at":"2026-05-18T04:23:03Z"},{"alias_kind":"pith_short_12","alias_value":"VXYVIWZOILPS","created_at":"2026-05-18T12:26:02Z"},{"alias_kind":"pith_short_16","alias_value":"VXYVIWZOILPSTR33","created_at":"2026-05-18T12:26:02Z"},{"alias_kind":"pith_short_8","alias_value":"VXYVIWZO","created_at":"2026-05-18T12:26:02Z"}],"graph_snapshots":[{"event_id":"sha256:db03a387aaaac2a60c0dafa8eca280022f1e8c63af9964a241286ce764350f2c","target":"graph","created_at":"2026-05-18T04:23:03Z","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":"In this paper we study the minimal number of translates of an arbitrary subset $S$ of a group $G$ needed to cover the group, and related notions of the efficiency of such coverings. We focus mainly on finite subsets in discrete groups, reviewing the classical results in this area, and generalizing them to a much broader context. For example, we show that while the worst-case efficiency when $S$ has $k$ elements is of order $1/\\log k$, for $k$ fixed and $n$ large, almost every $k$-subset of any given $n$-element group covers $G$ with close to optimal efficiency.","authors_text":"Bela Bollobas, Oliver Riordan, Svante Janson","cross_cats":["math.NT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2009-10-20T11:42:58Z","title":"On covering by translates of a set"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0910.3815","kind":"arxiv","version":2},"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:c1f1f1c2dbbcd6d4fac77eaf996dca52ecf0478f097f3b43a53470089b55ac26","target":"record","created_at":"2026-05-18T04:23:03Z","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":"1371d759a8ce80d4c26d239398f22b32fd644bc4d78f06395e956116562a10ba","cross_cats_sorted":["math.NT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2009-10-20T11:42:58Z","title_canon_sha256":"e5c2f83b4a265a1c00cb3ccf80e0d36e760bf90ab91a9308dc49df4055154c60"},"schema_version":"1.0","source":{"id":"0910.3815","kind":"arxiv","version":2}},"canonical_sha256":"adf1545b2e42df29c77baa74f1e5a00973a14c7e19cf72300c0d6ecde0cdc533","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"adf1545b2e42df29c77baa74f1e5a00973a14c7e19cf72300c0d6ecde0cdc533","first_computed_at":"2026-05-18T04:23:03.251387Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:23:03.251387Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"94qzqST3zvluNNB9jz5FwXTPjXLHXcn5GmsadCos01bNWqhtmUWpByu9lOU7a1VfDaK+nWygr+KxBybg4k4bDg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:23:03.252028Z","signed_message":"canonical_sha256_bytes"},"source_id":"0910.3815","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c1f1f1c2dbbcd6d4fac77eaf996dca52ecf0478f097f3b43a53470089b55ac26","sha256:db03a387aaaac2a60c0dafa8eca280022f1e8c63af9964a241286ce764350f2c"],"state_sha256":"a46d2cb30d0aed5332736138fb16d3c371e07491f6ddeae6d7370a28b21402b5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"A7q0vs3+r+fm5YUb5MlaMEdfycgfcfQUBtAHx4GTMvyekrCjp3q3lrZ+KlfjY91p+hwpBqNKPTAoio/gxmjaAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T17:57:57.059892Z","bundle_sha256":"22aa55979681790fded588040e882618e1ee97bb867975b524a10e1c3fbd910f"}}