{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:44EQ24YD6IEAA56BY4SZYZSCBU","short_pith_number":"pith:44EQ24YD","canonical_record":{"source":{"id":"1311.1707","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-11-07T15:02:40Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"dd05f24f6f9297cd017157f33f7adbf485f7919372755420e85f0bc03c080d41","abstract_canon_sha256":"fe7ae99a9e25fcaccd9871203d1315348afe636b95497eb63891dad43ab53500"},"schema_version":"1.0"},"canonical_sha256":"e7090d7303f2080077c1c7259c66420d064fea945a4a7f45d6c7a38076e3507a","source":{"kind":"arxiv","id":"1311.1707","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1311.1707","created_at":"2026-05-18T02:09:41Z"},{"alias_kind":"arxiv_version","alias_value":"1311.1707v1","created_at":"2026-05-18T02:09:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.1707","created_at":"2026-05-18T02:09:41Z"},{"alias_kind":"pith_short_12","alias_value":"44EQ24YD6IEA","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_16","alias_value":"44EQ24YD6IEAA56B","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_8","alias_value":"44EQ24YD","created_at":"2026-05-18T12:27:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:44EQ24YD6IEAA56BY4SZYZSCBU","target":"record","payload":{"canonical_record":{"source":{"id":"1311.1707","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-11-07T15:02:40Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"dd05f24f6f9297cd017157f33f7adbf485f7919372755420e85f0bc03c080d41","abstract_canon_sha256":"fe7ae99a9e25fcaccd9871203d1315348afe636b95497eb63891dad43ab53500"},"schema_version":"1.0"},"canonical_sha256":"e7090d7303f2080077c1c7259c66420d064fea945a4a7f45d6c7a38076e3507a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:09:41.982771Z","signature_b64":"kjNqD+m/Y+fDW9gTkITjJe7U6MPd+4Zj/XdP/BgR+EtV5+zJuEBzb9vrym1ZeVjmAQm/Y0gpCg6EOt/5PQP+Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e7090d7303f2080077c1c7259c66420d064fea945a4a7f45d6c7a38076e3507a","last_reissued_at":"2026-05-18T02:09:41.982064Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:09:41.982064Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1311.1707","source_version":1,"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-18T02:09:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"U4barba+Rard8/gbr94qF7d6RrnIKMCnUG4Fdcg6xtsxZjwL3lQshzML9ewoEfVxHDuBp/Q/TOKrN2Nh0Qd9Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T20:37:54.211431Z"},"content_sha256":"746d3fcacdaca978ad6d0f74b2514832bfd15748c0395d6d7091f5f28077a8b6","schema_version":"1.0","event_id":"sha256:746d3fcacdaca978ad6d0f74b2514832bfd15748c0395d6d7091f5f28077a8b6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:44EQ24YD6IEAA56BY4SZYZSCBU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The probabilistic approach to 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":"2013-11-07T15:02:40Z","abstract_excerpt":"We consider (closed neighbourhood) packings and their generalization in graphs. 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)$ of a graph 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.\n  In this paper, we develop a new probabilistic approach to limited packings in graphs, resulting in lower bounds for the k-limited packing number and a randomized al"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.1707","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"},"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-18T02:09:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nxm4yaqYu/juhxrXPmcNV2DjjUIIxeg2q8g6bkKjLa3/IslIfxpF9Np4H7I4les9plxEXBOTUQ87DfKB4RArAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T20:37:54.211794Z"},"content_sha256":"74b770e64d5c32118b9142a2ed015572f87435e3c572279aab52c3e7657edd00","schema_version":"1.0","event_id":"sha256:74b770e64d5c32118b9142a2ed015572f87435e3c572279aab52c3e7657edd00"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/44EQ24YD6IEAA56BY4SZYZSCBU/bundle.json","state_url":"https://pith.science/pith/44EQ24YD6IEAA56BY4SZYZSCBU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/44EQ24YD6IEAA56BY4SZYZSCBU/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-06-22T20:37:54Z","links":{"resolver":"https://pith.science/pith/44EQ24YD6IEAA56BY4SZYZSCBU","bundle":"https://pith.science/pith/44EQ24YD6IEAA56BY4SZYZSCBU/bundle.json","state":"https://pith.science/pith/44EQ24YD6IEAA56BY4SZYZSCBU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/44EQ24YD6IEAA56BY4SZYZSCBU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:44EQ24YD6IEAA56BY4SZYZSCBU","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":"fe7ae99a9e25fcaccd9871203d1315348afe636b95497eb63891dad43ab53500","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-11-07T15:02:40Z","title_canon_sha256":"dd05f24f6f9297cd017157f33f7adbf485f7919372755420e85f0bc03c080d41"},"schema_version":"1.0","source":{"id":"1311.1707","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1311.1707","created_at":"2026-05-18T02:09:41Z"},{"alias_kind":"arxiv_version","alias_value":"1311.1707v1","created_at":"2026-05-18T02:09:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.1707","created_at":"2026-05-18T02:09:41Z"},{"alias_kind":"pith_short_12","alias_value":"44EQ24YD6IEA","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_16","alias_value":"44EQ24YD6IEAA56B","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_8","alias_value":"44EQ24YD","created_at":"2026-05-18T12:27:32Z"}],"graph_snapshots":[{"event_id":"sha256:74b770e64d5c32118b9142a2ed015572f87435e3c572279aab52c3e7657edd00","target":"graph","created_at":"2026-05-18T02:09:41Z","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":"We consider (closed neighbourhood) packings and their generalization in graphs. 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)$ of a graph 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.\n  In this paper, we develop a new probabilistic approach to limited packings in graphs, resulting in lower bounds for the k-limited packing number and a randomized al","authors_text":"Andrei Gagarin, Vadim Zverovich","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-11-07T15:02:40Z","title":"The probabilistic approach to limited packings in graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.1707","kind":"arxiv","version":1},"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:746d3fcacdaca978ad6d0f74b2514832bfd15748c0395d6d7091f5f28077a8b6","target":"record","created_at":"2026-05-18T02:09:41Z","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":"fe7ae99a9e25fcaccd9871203d1315348afe636b95497eb63891dad43ab53500","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-11-07T15:02:40Z","title_canon_sha256":"dd05f24f6f9297cd017157f33f7adbf485f7919372755420e85f0bc03c080d41"},"schema_version":"1.0","source":{"id":"1311.1707","kind":"arxiv","version":1}},"canonical_sha256":"e7090d7303f2080077c1c7259c66420d064fea945a4a7f45d6c7a38076e3507a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e7090d7303f2080077c1c7259c66420d064fea945a4a7f45d6c7a38076e3507a","first_computed_at":"2026-05-18T02:09:41.982064Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:09:41.982064Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kjNqD+m/Y+fDW9gTkITjJe7U6MPd+4Zj/XdP/BgR+EtV5+zJuEBzb9vrym1ZeVjmAQm/Y0gpCg6EOt/5PQP+Aw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:09:41.982771Z","signed_message":"canonical_sha256_bytes"},"source_id":"1311.1707","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:746d3fcacdaca978ad6d0f74b2514832bfd15748c0395d6d7091f5f28077a8b6","sha256:74b770e64d5c32118b9142a2ed015572f87435e3c572279aab52c3e7657edd00"],"state_sha256":"c66c17aa5cb19c47baf5d8dccd2562a0bc3baab2749862110c2cbd4082486b34"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"G2uEpv+g0t20LAxSEjJdRD/raKKmtJXqqD3XmAWFoBvI5RVeO/U+v6LMW2HA+frhmqaauK0DNMQGUkrAy1o/DQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T20:37:54.213759Z","bundle_sha256":"c977e36be9cfc5d05c135220ea7ec516372e65bca91ff972199100abcc2d5e78"}}