{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:W2YQ3KIIOH7HCNJJFSHCS3Z34Y","short_pith_number":"pith:W2YQ3KII","schema_version":"1.0","canonical_sha256":"b6b10da90871fe7135292c8e296f3be61ba8a7112b3d39555d4795380ea23559","source":{"kind":"arxiv","id":"1407.1637","version":1},"attestation_state":"computed","paper":{"title":"Bounds and algorithms for limited packings in graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Andrei Gagarin, Vadim Zverovich","submitted_at":"2014-07-07T09:24:17Z","abstract_excerpt":"We consider (closed neighbourhood) packings and their generalization in graphs called limited packings. A vertex set X in a graph G is a k-limited packing if for any vertex $v\\in V(G)$, $\\left|N[v] \\cap X\\right| \\le k$, where $N[v]$ is the closed neighbourhood of $v$. The k-limited packing number $L_k(G)$ is the largest size of a k-limited packing in G. Limited packing problems can be considered as secure facility location problems in networks. We develop probabilistic and greedy approaches to limited packings in graphs, providing lower bounds for the k-limited packing number, and randomized a"},"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":"1407.1637","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-07-07T09:24:17Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"1a8426dabc4bc756c21b27ea5a82eea1ef30253924febc5fb2efee3d5ec3b075","abstract_canon_sha256":"c6e773fed950594f34fa07851f506f5e5884e3be76d31f9caa1c58ac30ec5dc0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:48:10.855093Z","signature_b64":"bxxQo25K66qGmQ/KWCK+INo1ZCx1bmhSSEONXW+cBCGzMBSJ+vmqTcIIUbwONVU04ivInYGyBtMqePPz8B6VCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b6b10da90871fe7135292c8e296f3be61ba8a7112b3d39555d4795380ea23559","last_reissued_at":"2026-05-18T02:48:10.854548Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:48:10.854548Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Bounds and algorithms for limited packings in graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Andrei Gagarin, Vadim Zverovich","submitted_at":"2014-07-07T09:24:17Z","abstract_excerpt":"We consider (closed neighbourhood) packings and their generalization in graphs called limited packings. A vertex set X in a graph G is a k-limited packing if for any vertex $v\\in V(G)$, $\\left|N[v] \\cap X\\right| \\le k$, where $N[v]$ is the closed neighbourhood of $v$. The k-limited packing number $L_k(G)$ is the largest size of a k-limited packing in G. Limited packing problems can be considered as secure facility location problems in networks. We develop probabilistic and greedy approaches to limited packings in graphs, providing lower bounds for the k-limited packing number, and randomized a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.1637","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":"1407.1637","created_at":"2026-05-18T02:48:10.854640+00:00"},{"alias_kind":"arxiv_version","alias_value":"1407.1637v1","created_at":"2026-05-18T02:48:10.854640+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.1637","created_at":"2026-05-18T02:48:10.854640+00:00"},{"alias_kind":"pith_short_12","alias_value":"W2YQ3KIIOH7H","created_at":"2026-05-18T12:28:54.890064+00:00"},{"alias_kind":"pith_short_16","alias_value":"W2YQ3KIIOH7HCNJJ","created_at":"2026-05-18T12:28:54.890064+00:00"},{"alias_kind":"pith_short_8","alias_value":"W2YQ3KII","created_at":"2026-05-18T12:28:54.890064+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/W2YQ3KIIOH7HCNJJFSHCS3Z34Y","json":"https://pith.science/pith/W2YQ3KIIOH7HCNJJFSHCS3Z34Y.json","graph_json":"https://pith.science/api/pith-number/W2YQ3KIIOH7HCNJJFSHCS3Z34Y/graph.json","events_json":"https://pith.science/api/pith-number/W2YQ3KIIOH7HCNJJFSHCS3Z34Y/events.json","paper":"https://pith.science/paper/W2YQ3KII"},"agent_actions":{"view_html":"https://pith.science/pith/W2YQ3KIIOH7HCNJJFSHCS3Z34Y","download_json":"https://pith.science/pith/W2YQ3KIIOH7HCNJJFSHCS3Z34Y.json","view_paper":"https://pith.science/paper/W2YQ3KII","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1407.1637&json=true","fetch_graph":"https://pith.science/api/pith-number/W2YQ3KIIOH7HCNJJFSHCS3Z34Y/graph.json","fetch_events":"https://pith.science/api/pith-number/W2YQ3KIIOH7HCNJJFSHCS3Z34Y/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/W2YQ3KIIOH7HCNJJFSHCS3Z34Y/action/timestamp_anchor","attest_storage":"https://pith.science/pith/W2YQ3KIIOH7HCNJJFSHCS3Z34Y/action/storage_attestation","attest_author":"https://pith.science/pith/W2YQ3KIIOH7HCNJJFSHCS3Z34Y/action/author_attestation","sign_citation":"https://pith.science/pith/W2YQ3KIIOH7HCNJJFSHCS3Z34Y/action/citation_signature","submit_replication":"https://pith.science/pith/W2YQ3KIIOH7HCNJJFSHCS3Z34Y/action/replication_record"}},"created_at":"2026-05-18T02:48:10.854640+00:00","updated_at":"2026-05-18T02:48:10.854640+00:00"}