{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:GRX6S5NS5JFZ4E5OWJHWS5BFBN","short_pith_number":"pith:GRX6S5NS","canonical_record":{"source":{"id":"1507.08745","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-07-31T04:00:51Z","cross_cats_sorted":[],"title_canon_sha256":"3f1d078c44cc0f67b439fb33705bbb975ae784e6dafa8a4d1f32a36db02d26b8","abstract_canon_sha256":"7439e33b1fbbb079873c50a669914664b2c97275799ef0773b34e79ff32277f4"},"schema_version":"1.0"},"canonical_sha256":"346fe975b2ea4b9e13aeb24f6974250b748cca88afb0c07b748c5685ac700461","source":{"kind":"arxiv","id":"1507.08745","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.08745","created_at":"2026-05-18T01:36:02Z"},{"alias_kind":"arxiv_version","alias_value":"1507.08745v1","created_at":"2026-05-18T01:36:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.08745","created_at":"2026-05-18T01:36:02Z"},{"alias_kind":"pith_short_12","alias_value":"GRX6S5NS5JFZ","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_16","alias_value":"GRX6S5NS5JFZ4E5O","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_8","alias_value":"GRX6S5NS","created_at":"2026-05-18T12:29:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:GRX6S5NS5JFZ4E5OWJHWS5BFBN","target":"record","payload":{"canonical_record":{"source":{"id":"1507.08745","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-07-31T04:00:51Z","cross_cats_sorted":[],"title_canon_sha256":"3f1d078c44cc0f67b439fb33705bbb975ae784e6dafa8a4d1f32a36db02d26b8","abstract_canon_sha256":"7439e33b1fbbb079873c50a669914664b2c97275799ef0773b34e79ff32277f4"},"schema_version":"1.0"},"canonical_sha256":"346fe975b2ea4b9e13aeb24f6974250b748cca88afb0c07b748c5685ac700461","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:36:02.968962Z","signature_b64":"UZYSuJTL009H1bb5DT4kscXXRnw9q9rG7xbhvsWb3L2Eqg5MNPdtm6/7sKcTmDO/GzBTMQLPt8D4ZmlWmiBWAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"346fe975b2ea4b9e13aeb24f6974250b748cca88afb0c07b748c5685ac700461","last_reissued_at":"2026-05-18T01:36:02.968409Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:36:02.968409Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1507.08745","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-18T01:36:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OxofJ+wxh8cqM8ZThBJnw4gAYtbHiJ4aEcbLp15te8NDDvtB9zJe6mUN8eTqSogavqBAblNd8VeTH6J4FwgqCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T04:01:45.215903Z"},"content_sha256":"68c56dce8f2a9c4c271fda561b5c117b84871fadfb9b0a8604d0837de2e4a00e","schema_version":"1.0","event_id":"sha256:68c56dce8f2a9c4c271fda561b5c117b84871fadfb9b0a8604d0837de2e4a00e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:GRX6S5NS5JFZ4E5OWJHWS5BFBN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Lower Bounds on the Distance Domination Number of a Graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Caleb Fast, Franklin Kenter, Michael Henning, Randy Davila","submitted_at":"2015-07-31T04:00:51Z","abstract_excerpt":"For an integer $k \\ge 1$, a (distance) $k$-dominating set of a connected graph $G$ is a set $S$ of vertices of $G$ such that every vertex of $V(G) \\setminus S$ is at distance at most~$k$ from some vertex of $S$. The $k$-domination number, $\\gamma_k(G)$, of $G$ is the minimum cardinality of a $k$-dominating set of $G$. In this paper, we establish lower bounds on the $k$-domination number of a graph in terms of its diameter, radius and girth. We prove that for connected graphs $G$ and $H$, $\\gamma_k(G \\times H) \\ge \\gamma_k(G) + \\gamma_k(H) -1$, where $G \\times H$ denotes the direct product of $"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.08745","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-18T01:36:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SE8YcrNSSCsIONV5XBG9QlK0MUU3hIObWAYQvlYSIYf1YYBjVZgorcTbH6VbLjO6ctGOzDzXeo+itWWnLtNgCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T04:01:45.216633Z"},"content_sha256":"b3472c71cdcbb4d5c50175c232507b8437b7eb2a572b60cb86f504278f18eda1","schema_version":"1.0","event_id":"sha256:b3472c71cdcbb4d5c50175c232507b8437b7eb2a572b60cb86f504278f18eda1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GRX6S5NS5JFZ4E5OWJHWS5BFBN/bundle.json","state_url":"https://pith.science/pith/GRX6S5NS5JFZ4E5OWJHWS5BFBN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GRX6S5NS5JFZ4E5OWJHWS5BFBN/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-31T04:01:45Z","links":{"resolver":"https://pith.science/pith/GRX6S5NS5JFZ4E5OWJHWS5BFBN","bundle":"https://pith.science/pith/GRX6S5NS5JFZ4E5OWJHWS5BFBN/bundle.json","state":"https://pith.science/pith/GRX6S5NS5JFZ4E5OWJHWS5BFBN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GRX6S5NS5JFZ4E5OWJHWS5BFBN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:GRX6S5NS5JFZ4E5OWJHWS5BFBN","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":"7439e33b1fbbb079873c50a669914664b2c97275799ef0773b34e79ff32277f4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-07-31T04:00:51Z","title_canon_sha256":"3f1d078c44cc0f67b439fb33705bbb975ae784e6dafa8a4d1f32a36db02d26b8"},"schema_version":"1.0","source":{"id":"1507.08745","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.08745","created_at":"2026-05-18T01:36:02Z"},{"alias_kind":"arxiv_version","alias_value":"1507.08745v1","created_at":"2026-05-18T01:36:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.08745","created_at":"2026-05-18T01:36:02Z"},{"alias_kind":"pith_short_12","alias_value":"GRX6S5NS5JFZ","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_16","alias_value":"GRX6S5NS5JFZ4E5O","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_8","alias_value":"GRX6S5NS","created_at":"2026-05-18T12:29:22Z"}],"graph_snapshots":[{"event_id":"sha256:b3472c71cdcbb4d5c50175c232507b8437b7eb2a572b60cb86f504278f18eda1","target":"graph","created_at":"2026-05-18T01:36:02Z","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":"For an integer $k \\ge 1$, a (distance) $k$-dominating set of a connected graph $G$ is a set $S$ of vertices of $G$ such that every vertex of $V(G) \\setminus S$ is at distance at most~$k$ from some vertex of $S$. The $k$-domination number, $\\gamma_k(G)$, of $G$ is the minimum cardinality of a $k$-dominating set of $G$. In this paper, we establish lower bounds on the $k$-domination number of a graph in terms of its diameter, radius and girth. We prove that for connected graphs $G$ and $H$, $\\gamma_k(G \\times H) \\ge \\gamma_k(G) + \\gamma_k(H) -1$, where $G \\times H$ denotes the direct product of $","authors_text":"Caleb Fast, Franklin Kenter, Michael Henning, Randy Davila","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-07-31T04:00:51Z","title":"Lower Bounds on the Distance Domination Number of a Graph"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.08745","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:68c56dce8f2a9c4c271fda561b5c117b84871fadfb9b0a8604d0837de2e4a00e","target":"record","created_at":"2026-05-18T01:36:02Z","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":"7439e33b1fbbb079873c50a669914664b2c97275799ef0773b34e79ff32277f4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-07-31T04:00:51Z","title_canon_sha256":"3f1d078c44cc0f67b439fb33705bbb975ae784e6dafa8a4d1f32a36db02d26b8"},"schema_version":"1.0","source":{"id":"1507.08745","kind":"arxiv","version":1}},"canonical_sha256":"346fe975b2ea4b9e13aeb24f6974250b748cca88afb0c07b748c5685ac700461","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"346fe975b2ea4b9e13aeb24f6974250b748cca88afb0c07b748c5685ac700461","first_computed_at":"2026-05-18T01:36:02.968409Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:36:02.968409Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"UZYSuJTL009H1bb5DT4kscXXRnw9q9rG7xbhvsWb3L2Eqg5MNPdtm6/7sKcTmDO/GzBTMQLPt8D4ZmlWmiBWAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:36:02.968962Z","signed_message":"canonical_sha256_bytes"},"source_id":"1507.08745","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:68c56dce8f2a9c4c271fda561b5c117b84871fadfb9b0a8604d0837de2e4a00e","sha256:b3472c71cdcbb4d5c50175c232507b8437b7eb2a572b60cb86f504278f18eda1"],"state_sha256":"1c21910a3999451e697e87a0ace43027ba03f59029205c881126254c3dc86868"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"k4tVsGpMljv/8XKJvEo57bp4+JWjPINxO3//eI5JwXUcyhgZYPafcBlm/0emsZ8I/2glxz2ulInQsANrbksRBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T04:01:45.220130Z","bundle_sha256":"29ff8352099d4640584b0f3d7e7bfee12a863f98d4688d1d77f8c58c1e0a5d96"}}