{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:N425CSMWT273VMGNQSLKBH763S","short_pith_number":"pith:N425CSMW","canonical_record":{"source":{"id":"2503.05562","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-03-07T16:40:09Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"267bc405c3057ca2347dba3294a333878ba2c447ebecb7371aee054a6c07d974","abstract_canon_sha256":"7676149e88e7edaada86bc8d38212a3dec5a60834ab3ff7950c4b3a5365adf06"},"schema_version":"1.0"},"canonical_sha256":"6f35d149969ebfbab0cd8496a09ffedcac69ef4dac24ec535585bfeb8c54bc9c","source":{"kind":"arxiv","id":"2503.05562","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2503.05562","created_at":"2026-07-05T10:26:31Z"},{"alias_kind":"arxiv_version","alias_value":"2503.05562v1","created_at":"2026-07-05T10:26:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2503.05562","created_at":"2026-07-05T10:26:31Z"},{"alias_kind":"pith_short_12","alias_value":"N425CSMWT273","created_at":"2026-07-05T10:26:31Z"},{"alias_kind":"pith_short_16","alias_value":"N425CSMWT273VMGN","created_at":"2026-07-05T10:26:31Z"},{"alias_kind":"pith_short_8","alias_value":"N425CSMW","created_at":"2026-07-05T10:26:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:N425CSMWT273VMGNQSLKBH763S","target":"record","payload":{"canonical_record":{"source":{"id":"2503.05562","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-03-07T16:40:09Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"267bc405c3057ca2347dba3294a333878ba2c447ebecb7371aee054a6c07d974","abstract_canon_sha256":"7676149e88e7edaada86bc8d38212a3dec5a60834ab3ff7950c4b3a5365adf06"},"schema_version":"1.0"},"canonical_sha256":"6f35d149969ebfbab0cd8496a09ffedcac69ef4dac24ec535585bfeb8c54bc9c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:26:31.855826Z","signature_b64":"CaQMg8GdXZ+RalJ8TkjC8NsqpS7A7WI8ForWnll/LB7TPZf3bVx2ymM6qs0lpyBO8EVJwFt3z9uzMxmTaSy2Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6f35d149969ebfbab0cd8496a09ffedcac69ef4dac24ec535585bfeb8c54bc9c","last_reissued_at":"2026-07-05T10:26:31.855334Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:26:31.855334Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2503.05562","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-07-05T10:26:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iCIwFv06NROYWGaXGTafLk0DyU2LyZGHqIZ82EFe8EWm48b6g/bK61AQ1vxE+Xi8R+tKU1vXeuvlmY2iqPY3Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T15:55:09.832075Z"},"content_sha256":"878dcf2b2db457cd2940e4ff838a530a4913509a02657cc8f17dff1e9536635c","schema_version":"1.0","event_id":"sha256:878dcf2b2db457cd2940e4ff838a530a4913509a02657cc8f17dff1e9536635c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:N425CSMWT273VMGNQSLKBH763S","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On graph classes with constant domination-packing ratio","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Anna Gujgiczer, Marthe Bonamy, M\\'onika Csik\\'os, Yelena Yuditsky","submitted_at":"2025-03-07T16:40:09Z","abstract_excerpt":"The dominating number $\\gamma(G)$ of a graph $G$ is the minimum size of a vertex set whose closed neighborhood covers all the vertices of the graph. The packing number $\\rho(G)$ of $G$ is the maximum size of a vertex set whose closed neighborhoods are pairwise disjoint. In this paper we study graph classes ${\\cal G}$ such that $\\gamma(G)/\\rho(G)$ is bounded by a constant $c_{\\cal G}$ for each $G\\in {\\cal G}$. We propose an inductive proof technique to prove that if $\\cal G$ is the class of $2$-degenerate graphs, then there is such a constant bound $c_{\\cal G}$. We note that this is the first m"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2503.05562","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/2503.05562/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-07-05T10:26:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"txW9hXCQXpbmy4wnLNQbXAd0404UggIxl7mTjHzTnq+apekUnrYxlxSwr+zKIjKoKykCDv9fH9c+CpSs+VEkAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T15:55:09.832483Z"},"content_sha256":"cc5c08a848f34eae713fef07e8eb1636e9421197e263897cbcdf691c7f1a9af0","schema_version":"1.0","event_id":"sha256:cc5c08a848f34eae713fef07e8eb1636e9421197e263897cbcdf691c7f1a9af0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/N425CSMWT273VMGNQSLKBH763S/bundle.json","state_url":"https://pith.science/pith/N425CSMWT273VMGNQSLKBH763S/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/N425CSMWT273VMGNQSLKBH763S/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-05T15:55:09Z","links":{"resolver":"https://pith.science/pith/N425CSMWT273VMGNQSLKBH763S","bundle":"https://pith.science/pith/N425CSMWT273VMGNQSLKBH763S/bundle.json","state":"https://pith.science/pith/N425CSMWT273VMGNQSLKBH763S/state.json","well_known_bundle":"https://pith.science/.well-known/pith/N425CSMWT273VMGNQSLKBH763S/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:N425CSMWT273VMGNQSLKBH763S","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":"7676149e88e7edaada86bc8d38212a3dec5a60834ab3ff7950c4b3a5365adf06","cross_cats_sorted":["cs.DM"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-03-07T16:40:09Z","title_canon_sha256":"267bc405c3057ca2347dba3294a333878ba2c447ebecb7371aee054a6c07d974"},"schema_version":"1.0","source":{"id":"2503.05562","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2503.05562","created_at":"2026-07-05T10:26:31Z"},{"alias_kind":"arxiv_version","alias_value":"2503.05562v1","created_at":"2026-07-05T10:26:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2503.05562","created_at":"2026-07-05T10:26:31Z"},{"alias_kind":"pith_short_12","alias_value":"N425CSMWT273","created_at":"2026-07-05T10:26:31Z"},{"alias_kind":"pith_short_16","alias_value":"N425CSMWT273VMGN","created_at":"2026-07-05T10:26:31Z"},{"alias_kind":"pith_short_8","alias_value":"N425CSMW","created_at":"2026-07-05T10:26:31Z"}],"graph_snapshots":[{"event_id":"sha256:cc5c08a848f34eae713fef07e8eb1636e9421197e263897cbcdf691c7f1a9af0","target":"graph","created_at":"2026-07-05T10:26:31Z","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/2503.05562/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The dominating number $\\gamma(G)$ of a graph $G$ is the minimum size of a vertex set whose closed neighborhood covers all the vertices of the graph. The packing number $\\rho(G)$ of $G$ is the maximum size of a vertex set whose closed neighborhoods are pairwise disjoint. In this paper we study graph classes ${\\cal G}$ such that $\\gamma(G)/\\rho(G)$ is bounded by a constant $c_{\\cal G}$ for each $G\\in {\\cal G}$. We propose an inductive proof technique to prove that if $\\cal G$ is the class of $2$-degenerate graphs, then there is such a constant bound $c_{\\cal G}$. We note that this is the first m","authors_text":"Anna Gujgiczer, Marthe Bonamy, M\\'onika Csik\\'os, Yelena Yuditsky","cross_cats":["cs.DM"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-03-07T16:40:09Z","title":"On graph classes with constant domination-packing ratio"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2503.05562","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:878dcf2b2db457cd2940e4ff838a530a4913509a02657cc8f17dff1e9536635c","target":"record","created_at":"2026-07-05T10:26:31Z","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":"7676149e88e7edaada86bc8d38212a3dec5a60834ab3ff7950c4b3a5365adf06","cross_cats_sorted":["cs.DM"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-03-07T16:40:09Z","title_canon_sha256":"267bc405c3057ca2347dba3294a333878ba2c447ebecb7371aee054a6c07d974"},"schema_version":"1.0","source":{"id":"2503.05562","kind":"arxiv","version":1}},"canonical_sha256":"6f35d149969ebfbab0cd8496a09ffedcac69ef4dac24ec535585bfeb8c54bc9c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6f35d149969ebfbab0cd8496a09ffedcac69ef4dac24ec535585bfeb8c54bc9c","first_computed_at":"2026-07-05T10:26:31.855334Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:26:31.855334Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"CaQMg8GdXZ+RalJ8TkjC8NsqpS7A7WI8ForWnll/LB7TPZf3bVx2ymM6qs0lpyBO8EVJwFt3z9uzMxmTaSy2Bw==","signature_status":"signed_v1","signed_at":"2026-07-05T10:26:31.855826Z","signed_message":"canonical_sha256_bytes"},"source_id":"2503.05562","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:878dcf2b2db457cd2940e4ff838a530a4913509a02657cc8f17dff1e9536635c","sha256:cc5c08a848f34eae713fef07e8eb1636e9421197e263897cbcdf691c7f1a9af0"],"state_sha256":"6c6d485495d27ef8bfff178b87141d7a1cca4554e0170b9748ee61a3f0a6a939"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yjaySb779GkRWQmjLeIZpHJcN4zKTe39+NqbZN0xm3UmNIUtFlqvx0sIRWb6U55G/sNOvAv/XmN6y4bdk0szAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-05T15:55:09.834855Z","bundle_sha256":"7b7d984dae49ff9ccd0abec7b2178ad8da14f07fc793763ecf08047a648e7c63"}}