{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:JITCBUZZ7T3NO3U25PG55EAZVH","short_pith_number":"pith:JITCBUZZ","canonical_record":{"source":{"id":"1807.01021","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-07-03T08:34:05Z","cross_cats_sorted":[],"title_canon_sha256":"75feb9069fb5057b2f378b91c619b2b370b622566d92ed681e8ae251d75f92c1","abstract_canon_sha256":"1cd19add7f5313c71689c176b304f5a37a4c870339d3472ab09ddaa04318304d"},"schema_version":"1.0"},"canonical_sha256":"4a2620d339fcf6d76e9aebcdde9019a9e73996cb33d507bcabe0ab238aeaeacb","source":{"kind":"arxiv","id":"1807.01021","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.01021","created_at":"2026-05-18T00:11:45Z"},{"alias_kind":"arxiv_version","alias_value":"1807.01021v1","created_at":"2026-05-18T00:11:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.01021","created_at":"2026-05-18T00:11:45Z"},{"alias_kind":"pith_short_12","alias_value":"JITCBUZZ7T3N","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_16","alias_value":"JITCBUZZ7T3NO3U2","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_8","alias_value":"JITCBUZZ","created_at":"2026-05-18T12:32:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:JITCBUZZ7T3NO3U25PG55EAZVH","target":"record","payload":{"canonical_record":{"source":{"id":"1807.01021","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-07-03T08:34:05Z","cross_cats_sorted":[],"title_canon_sha256":"75feb9069fb5057b2f378b91c619b2b370b622566d92ed681e8ae251d75f92c1","abstract_canon_sha256":"1cd19add7f5313c71689c176b304f5a37a4c870339d3472ab09ddaa04318304d"},"schema_version":"1.0"},"canonical_sha256":"4a2620d339fcf6d76e9aebcdde9019a9e73996cb33d507bcabe0ab238aeaeacb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:11:45.626479Z","signature_b64":"wl98j6fmOpxMYzb6KpTCG3ruNYQpWRfMHePsSyS9VWH3pnU9X7ijZjt9aFj390KOJ1hvXAbGW+dUy4TjniYfBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4a2620d339fcf6d76e9aebcdde9019a9e73996cb33d507bcabe0ab238aeaeacb","last_reissued_at":"2026-05-18T00:11:45.625909Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:11:45.625909Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1807.01021","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-18T00:11:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WcEmDGldrO3w98KbZBdQvYbdYu38qt8cCOOluE2h20D4XSXOb2Nwpp3l4IakcZLLqn8bJzWP7z6NlFfof8n9DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T03:17:28.771297Z"},"content_sha256":"032f02fbe97efe61691e57e702928fa4ab9b7f886bcca9a76acd6d3e41dc4f38","schema_version":"1.0","event_id":"sha256:032f02fbe97efe61691e57e702928fa4ab9b7f886bcca9a76acd6d3e41dc4f38"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:JITCBUZZ7T3NO3U25PG55EAZVH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"More on limited packings in graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Hong Chang, Xueliang Li, Xuqing Bai","submitted_at":"2018-07-03T08:34:05Z","abstract_excerpt":"A set $B$ of vertices in a graph $G$ is called a \\emph{$k$-limited packing} if for each vertex $v$ of $G$, its closed neighbourhood has at most $k$ vertices in $B$. The \\emph{$k$-limited packing number} of a graph $G$, denoted by $L_k(G)$, is the largest number of vertices in a $k$-limited packing in $G$. The concept of the $k$-limited packing of a graph was introduced by Gallant et al., which is a generalization of the well-known packing of a graph. In this paper, we present some tight bounds for the $k$-limited packing number of a graph in terms of its order, diameter, girth, and maximum deg"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.01021","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-18T00:11:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8ysMeHdDC7XSF59Na61IgNQnOvhAiVlDLtZOmgHx54+yTIIMQ1bnHp+1NSMPyejYI0ERYVuF5c0O2smHaXbVDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T03:17:28.772010Z"},"content_sha256":"ebeaa9b67b839f34e70139d93a2c7d2d603b8ee6e3150b8df33d09e042a8aeb7","schema_version":"1.0","event_id":"sha256:ebeaa9b67b839f34e70139d93a2c7d2d603b8ee6e3150b8df33d09e042a8aeb7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JITCBUZZ7T3NO3U25PG55EAZVH/bundle.json","state_url":"https://pith.science/pith/JITCBUZZ7T3NO3U25PG55EAZVH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JITCBUZZ7T3NO3U25PG55EAZVH/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-12T03:17:28Z","links":{"resolver":"https://pith.science/pith/JITCBUZZ7T3NO3U25PG55EAZVH","bundle":"https://pith.science/pith/JITCBUZZ7T3NO3U25PG55EAZVH/bundle.json","state":"https://pith.science/pith/JITCBUZZ7T3NO3U25PG55EAZVH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JITCBUZZ7T3NO3U25PG55EAZVH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:JITCBUZZ7T3NO3U25PG55EAZVH","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":"1cd19add7f5313c71689c176b304f5a37a4c870339d3472ab09ddaa04318304d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-07-03T08:34:05Z","title_canon_sha256":"75feb9069fb5057b2f378b91c619b2b370b622566d92ed681e8ae251d75f92c1"},"schema_version":"1.0","source":{"id":"1807.01021","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.01021","created_at":"2026-05-18T00:11:45Z"},{"alias_kind":"arxiv_version","alias_value":"1807.01021v1","created_at":"2026-05-18T00:11:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.01021","created_at":"2026-05-18T00:11:45Z"},{"alias_kind":"pith_short_12","alias_value":"JITCBUZZ7T3N","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_16","alias_value":"JITCBUZZ7T3NO3U2","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_8","alias_value":"JITCBUZZ","created_at":"2026-05-18T12:32:31Z"}],"graph_snapshots":[{"event_id":"sha256:ebeaa9b67b839f34e70139d93a2c7d2d603b8ee6e3150b8df33d09e042a8aeb7","target":"graph","created_at":"2026-05-18T00:11:45Z","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":"A set $B$ of vertices in a graph $G$ is called a \\emph{$k$-limited packing} if for each vertex $v$ of $G$, its closed neighbourhood has at most $k$ vertices in $B$. The \\emph{$k$-limited packing number} of a graph $G$, denoted by $L_k(G)$, is the largest number of vertices in a $k$-limited packing in $G$. The concept of the $k$-limited packing of a graph was introduced by Gallant et al., which is a generalization of the well-known packing of a graph. In this paper, we present some tight bounds for the $k$-limited packing number of a graph in terms of its order, diameter, girth, and maximum deg","authors_text":"Hong Chang, Xueliang Li, Xuqing Bai","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-07-03T08:34:05Z","title":"More on limited packings in graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.01021","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:032f02fbe97efe61691e57e702928fa4ab9b7f886bcca9a76acd6d3e41dc4f38","target":"record","created_at":"2026-05-18T00:11:45Z","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":"1cd19add7f5313c71689c176b304f5a37a4c870339d3472ab09ddaa04318304d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-07-03T08:34:05Z","title_canon_sha256":"75feb9069fb5057b2f378b91c619b2b370b622566d92ed681e8ae251d75f92c1"},"schema_version":"1.0","source":{"id":"1807.01021","kind":"arxiv","version":1}},"canonical_sha256":"4a2620d339fcf6d76e9aebcdde9019a9e73996cb33d507bcabe0ab238aeaeacb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4a2620d339fcf6d76e9aebcdde9019a9e73996cb33d507bcabe0ab238aeaeacb","first_computed_at":"2026-05-18T00:11:45.625909Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:11:45.625909Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wl98j6fmOpxMYzb6KpTCG3ruNYQpWRfMHePsSyS9VWH3pnU9X7ijZjt9aFj390KOJ1hvXAbGW+dUy4TjniYfBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:11:45.626479Z","signed_message":"canonical_sha256_bytes"},"source_id":"1807.01021","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:032f02fbe97efe61691e57e702928fa4ab9b7f886bcca9a76acd6d3e41dc4f38","sha256:ebeaa9b67b839f34e70139d93a2c7d2d603b8ee6e3150b8df33d09e042a8aeb7"],"state_sha256":"050cf83a9fdeff28973071a6a1819e1b8a4e99f7527c96348adf0051f97f05a2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KU4yqZtIOKVaVDSLbyDfLUSXlDdqCMxlSOsdsOos/RO4Mywpv61g8m05JS8BIkILgjNvPa+OOrV4YJqeuSQTDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-12T03:17:28.776158Z","bundle_sha256":"1dda8b423cb0ea59f0af2399c4178bdc7724f56df6141426b50077c5ee8b3cd3"}}