{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:QSPTT4H54YJ7T4EEWJB5HGTRGK","short_pith_number":"pith:QSPTT4H5","canonical_record":{"source":{"id":"2606.29199","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-06-28T04:58:55Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"3a09290a431fe90b552d3deb1730b17622d0a878fafb3a531f6b6db20e32b96c","abstract_canon_sha256":"b4f5609acc6a3bca35d09602a7852595d3781495c8e097e2c327704c42727951"},"schema_version":"1.0"},"canonical_sha256":"849f39f0fde613f9f084b243d39a7132a4831cdf5367e7badb499e7b15495405","source":{"kind":"arxiv","id":"2606.29199","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.29199","created_at":"2026-06-30T01:17:56Z"},{"alias_kind":"arxiv_version","alias_value":"2606.29199v1","created_at":"2026-06-30T01:17:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.29199","created_at":"2026-06-30T01:17:56Z"},{"alias_kind":"pith_short_12","alias_value":"QSPTT4H54YJ7","created_at":"2026-06-30T01:17:56Z"},{"alias_kind":"pith_short_16","alias_value":"QSPTT4H54YJ7T4EE","created_at":"2026-06-30T01:17:56Z"},{"alias_kind":"pith_short_8","alias_value":"QSPTT4H5","created_at":"2026-06-30T01:17:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:QSPTT4H54YJ7T4EEWJB5HGTRGK","target":"record","payload":{"canonical_record":{"source":{"id":"2606.29199","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-06-28T04:58:55Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"3a09290a431fe90b552d3deb1730b17622d0a878fafb3a531f6b6db20e32b96c","abstract_canon_sha256":"b4f5609acc6a3bca35d09602a7852595d3781495c8e097e2c327704c42727951"},"schema_version":"1.0"},"canonical_sha256":"849f39f0fde613f9f084b243d39a7132a4831cdf5367e7badb499e7b15495405","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-30T01:17:56.898766Z","signature_b64":"iHzPDNbYQ0316sFd8Os3aV/iMrPMUaGbmuduppSraaA3/ymktOSkaR8LK0XOMwmETOD6kE8ynwBHH8FJ0n74Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"849f39f0fde613f9f084b243d39a7132a4831cdf5367e7badb499e7b15495405","last_reissued_at":"2026-06-30T01:17:56.898110Z","signature_status":"signed_v1","first_computed_at":"2026-06-30T01:17:56.898110Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2606.29199","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-06-30T01:17:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JTrI079skrlnctIzR8V3vKtMMXnCY0fHPpF9bcRMwFi7FJCnaplsFkeua2bZBIs61S3mG9ot/TZOkOq4TPRTDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T05:39:49.061784Z"},"content_sha256":"24a550737b563068720f128a13fc20db2c426bb421ad177250484a437e9ee3dd","schema_version":"1.0","event_id":"sha256:24a550737b563068720f128a13fc20db2c426bb421ad177250484a437e9ee3dd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:QSPTT4H54YJ7T4EEWJB5HGTRGK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Improved Domination--Packing Bounds in Claw-Free Cubic Graphs and Unit Disk Graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Juan Guti\\'errez, Kaustav Paul","submitted_at":"2026-06-28T04:58:55Z","abstract_excerpt":"Given a graph $G$, the domination number $\\gamma(G)$ is the minimum cardinality of a dominating set in $G$, and the packing number $\\rho(G)$ is the maximum cardinality of a set of vertices that are pairwise at distance at least $3$. The ratio between these parameters has been widely studied in several graph classes. It is known that $\\gamma(G) \\le 2\\rho(G)$ for claw-free subcubic graphs, up to finitely many exceptions, and that $\\gamma(G) \\le 32\\rho(G)$ for unit disk graphs. In this paper, we improve the latter bound by showing that $\\gamma(G) \\le 16\\rho(G)$ for a unit disk graph $G$. For the "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.29199","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2606.29199/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-06-30T01:17:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0kWpxojB3kPY80SYqjCtBe+nspIdKI7Ju1k97JJ9LIYy44HzjP4ZZV9IU4lLDDqYDcXzJdoHV9B9KW1im8gkAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T05:39:49.062159Z"},"content_sha256":"cb35f45e36852e23de56d314e8ac9c45ef518c84aa6bd2396e7012e900bc9798","schema_version":"1.0","event_id":"sha256:cb35f45e36852e23de56d314e8ac9c45ef518c84aa6bd2396e7012e900bc9798"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QSPTT4H54YJ7T4EEWJB5HGTRGK/bundle.json","state_url":"https://pith.science/pith/QSPTT4H54YJ7T4EEWJB5HGTRGK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QSPTT4H54YJ7T4EEWJB5HGTRGK/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-07-02T05:39:49Z","links":{"resolver":"https://pith.science/pith/QSPTT4H54YJ7T4EEWJB5HGTRGK","bundle":"https://pith.science/pith/QSPTT4H54YJ7T4EEWJB5HGTRGK/bundle.json","state":"https://pith.science/pith/QSPTT4H54YJ7T4EEWJB5HGTRGK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QSPTT4H54YJ7T4EEWJB5HGTRGK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:QSPTT4H54YJ7T4EEWJB5HGTRGK","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":"b4f5609acc6a3bca35d09602a7852595d3781495c8e097e2c327704c42727951","cross_cats_sorted":["cs.DM"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-06-28T04:58:55Z","title_canon_sha256":"3a09290a431fe90b552d3deb1730b17622d0a878fafb3a531f6b6db20e32b96c"},"schema_version":"1.0","source":{"id":"2606.29199","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.29199","created_at":"2026-06-30T01:17:56Z"},{"alias_kind":"arxiv_version","alias_value":"2606.29199v1","created_at":"2026-06-30T01:17:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.29199","created_at":"2026-06-30T01:17:56Z"},{"alias_kind":"pith_short_12","alias_value":"QSPTT4H54YJ7","created_at":"2026-06-30T01:17:56Z"},{"alias_kind":"pith_short_16","alias_value":"QSPTT4H54YJ7T4EE","created_at":"2026-06-30T01:17:56Z"},{"alias_kind":"pith_short_8","alias_value":"QSPTT4H5","created_at":"2026-06-30T01:17:56Z"}],"graph_snapshots":[{"event_id":"sha256:cb35f45e36852e23de56d314e8ac9c45ef518c84aa6bd2396e7012e900bc9798","target":"graph","created_at":"2026-06-30T01:17:56Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2606.29199/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Given a graph $G$, the domination number $\\gamma(G)$ is the minimum cardinality of a dominating set in $G$, and the packing number $\\rho(G)$ is the maximum cardinality of a set of vertices that are pairwise at distance at least $3$. The ratio between these parameters has been widely studied in several graph classes. It is known that $\\gamma(G) \\le 2\\rho(G)$ for claw-free subcubic graphs, up to finitely many exceptions, and that $\\gamma(G) \\le 32\\rho(G)$ for unit disk graphs. In this paper, we improve the latter bound by showing that $\\gamma(G) \\le 16\\rho(G)$ for a unit disk graph $G$. For the ","authors_text":"Juan Guti\\'errez, Kaustav Paul","cross_cats":["cs.DM"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-06-28T04:58:55Z","title":"Improved Domination--Packing Bounds in Claw-Free Cubic Graphs and Unit Disk Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.29199","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:24a550737b563068720f128a13fc20db2c426bb421ad177250484a437e9ee3dd","target":"record","created_at":"2026-06-30T01:17:56Z","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":"b4f5609acc6a3bca35d09602a7852595d3781495c8e097e2c327704c42727951","cross_cats_sorted":["cs.DM"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-06-28T04:58:55Z","title_canon_sha256":"3a09290a431fe90b552d3deb1730b17622d0a878fafb3a531f6b6db20e32b96c"},"schema_version":"1.0","source":{"id":"2606.29199","kind":"arxiv","version":1}},"canonical_sha256":"849f39f0fde613f9f084b243d39a7132a4831cdf5367e7badb499e7b15495405","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"849f39f0fde613f9f084b243d39a7132a4831cdf5367e7badb499e7b15495405","first_computed_at":"2026-06-30T01:17:56.898110Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-30T01:17:56.898110Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"iHzPDNbYQ0316sFd8Os3aV/iMrPMUaGbmuduppSraaA3/ymktOSkaR8LK0XOMwmETOD6kE8ynwBHH8FJ0n74Cg==","signature_status":"signed_v1","signed_at":"2026-06-30T01:17:56.898766Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.29199","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:24a550737b563068720f128a13fc20db2c426bb421ad177250484a437e9ee3dd","sha256:cb35f45e36852e23de56d314e8ac9c45ef518c84aa6bd2396e7012e900bc9798"],"state_sha256":"e8b719bf4262a46e61032066cd84fbe0c6954d3ce6e6130ae9adcfa4b66adf79"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FL3vFyz2a3mhQYpUrIx+yz4u80j5n19CB+LxJL2/p6qQ5uHYOa7IYW8uhN9jn7XBghjrwevE6rOZudIVuJACDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-02T05:39:49.064433Z","bundle_sha256":"80157c05f557dab6e68e56c5c3e65149b82d4a3434a4c6c4ea79a6b52857f816"}}