{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:4NXSZL3N2SSURI65CU5GBJKHUT","short_pith_number":"pith:4NXSZL3N","schema_version":"1.0","canonical_sha256":"e36f2caf6dd4a548a3dd153a60a547a4e6054f69a3680475c8e7460c04f7837b","source":{"kind":"arxiv","id":"1501.01833","version":1},"attestation_state":"computed","paper":{"title":"Limited packings of closed neighbourhoods in graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"B\\'ela Bollob\\'as, Karen Gunderson, Paul N. Balister","submitted_at":"2015-01-08T13:17:15Z","abstract_excerpt":"The k-limited packing number, $L_k(G)$, of a graph $G$, introduced by Gallant, Gunther, Hartnell, and Rall, is the maximum cardinality of a set $X$ of vertices of $G$ such that every vertex of $G$ has at most $k$ elements of $X$ in its closed neighbourhood. The main aim in this paper is to prove the best-possible result that if $G$ is a cubic graph, then $L_2(G) \\geq |V (G)|/3$, improving the previous lower bound given by Gallant, \\emph{et al.}\n  In addition, we construct an infinite family of graphs to show that lower bounds given by Gagarin and Zverovich are asymptotically best-possible, up "},"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":"1501.01833","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-01-08T13:17:15Z","cross_cats_sorted":[],"title_canon_sha256":"847833e9343e80af480a10e07563055fa50b2b77e9bf023fafa2e20688efc270","abstract_canon_sha256":"a751aa2e9261e63e2d461b9dbd2f632010a31e4c05cad7f9e3161fa6588fec4a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:29:46.311828Z","signature_b64":"cwnjrlbkiIWqK3xjaRtr9dCBtSHLqomrBKSoZrWUdQ5clrRJgWJPMhQjWjkuyPjx+GPSNeXCT0tcUcZFnNv0Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e36f2caf6dd4a548a3dd153a60a547a4e6054f69a3680475c8e7460c04f7837b","last_reissued_at":"2026-05-18T02:29:46.311431Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:29:46.311431Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Limited packings of closed neighbourhoods in graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"B\\'ela Bollob\\'as, Karen Gunderson, Paul N. Balister","submitted_at":"2015-01-08T13:17:15Z","abstract_excerpt":"The k-limited packing number, $L_k(G)$, of a graph $G$, introduced by Gallant, Gunther, Hartnell, and Rall, is the maximum cardinality of a set $X$ of vertices of $G$ such that every vertex of $G$ has at most $k$ elements of $X$ in its closed neighbourhood. The main aim in this paper is to prove the best-possible result that if $G$ is a cubic graph, then $L_2(G) \\geq |V (G)|/3$, improving the previous lower bound given by Gallant, \\emph{et al.}\n  In addition, we construct an infinite family of graphs to show that lower bounds given by Gagarin and Zverovich are asymptotically best-possible, up "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.01833","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":"1501.01833","created_at":"2026-05-18T02:29:46.311490+00:00"},{"alias_kind":"arxiv_version","alias_value":"1501.01833v1","created_at":"2026-05-18T02:29:46.311490+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.01833","created_at":"2026-05-18T02:29:46.311490+00:00"},{"alias_kind":"pith_short_12","alias_value":"4NXSZL3N2SSU","created_at":"2026-05-18T12:29:05.191682+00:00"},{"alias_kind":"pith_short_16","alias_value":"4NXSZL3N2SSURI65","created_at":"2026-05-18T12:29:05.191682+00:00"},{"alias_kind":"pith_short_8","alias_value":"4NXSZL3N","created_at":"2026-05-18T12:29:05.191682+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/4NXSZL3N2SSURI65CU5GBJKHUT","json":"https://pith.science/pith/4NXSZL3N2SSURI65CU5GBJKHUT.json","graph_json":"https://pith.science/api/pith-number/4NXSZL3N2SSURI65CU5GBJKHUT/graph.json","events_json":"https://pith.science/api/pith-number/4NXSZL3N2SSURI65CU5GBJKHUT/events.json","paper":"https://pith.science/paper/4NXSZL3N"},"agent_actions":{"view_html":"https://pith.science/pith/4NXSZL3N2SSURI65CU5GBJKHUT","download_json":"https://pith.science/pith/4NXSZL3N2SSURI65CU5GBJKHUT.json","view_paper":"https://pith.science/paper/4NXSZL3N","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1501.01833&json=true","fetch_graph":"https://pith.science/api/pith-number/4NXSZL3N2SSURI65CU5GBJKHUT/graph.json","fetch_events":"https://pith.science/api/pith-number/4NXSZL3N2SSURI65CU5GBJKHUT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4NXSZL3N2SSURI65CU5GBJKHUT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4NXSZL3N2SSURI65CU5GBJKHUT/action/storage_attestation","attest_author":"https://pith.science/pith/4NXSZL3N2SSURI65CU5GBJKHUT/action/author_attestation","sign_citation":"https://pith.science/pith/4NXSZL3N2SSURI65CU5GBJKHUT/action/citation_signature","submit_replication":"https://pith.science/pith/4NXSZL3N2SSURI65CU5GBJKHUT/action/replication_record"}},"created_at":"2026-05-18T02:29:46.311490+00:00","updated_at":"2026-05-18T02:29:46.311490+00:00"}