{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:OSI54B3QWIWDVWICYH64XRLQ3G","short_pith_number":"pith:OSI54B3Q","canonical_record":{"source":{"id":"1906.00135","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-06-01T02:48:04Z","cross_cats_sorted":[],"title_canon_sha256":"46ec33a9a481b2e4b2ffd8fdc5b72e90be30c33ead0e948bec45925b609315a3","abstract_canon_sha256":"6e88d86d0e3da412e656db47fd6d3793c52c8723dbfcd176fae2cdb18e201ab3"},"schema_version":"1.0"},"canonical_sha256":"7491de0770b22c3ad902c1fdcbc570d980f5d698f1b2468377346d75b2a6ddc6","source":{"kind":"arxiv","id":"1906.00135","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.00135","created_at":"2026-05-17T23:44:28Z"},{"alias_kind":"arxiv_version","alias_value":"1906.00135v1","created_at":"2026-05-17T23:44:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.00135","created_at":"2026-05-17T23:44:28Z"},{"alias_kind":"pith_short_12","alias_value":"OSI54B3QWIWD","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_16","alias_value":"OSI54B3QWIWDVWIC","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_8","alias_value":"OSI54B3Q","created_at":"2026-05-18T12:33:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:OSI54B3QWIWDVWICYH64XRLQ3G","target":"record","payload":{"canonical_record":{"source":{"id":"1906.00135","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-06-01T02:48:04Z","cross_cats_sorted":[],"title_canon_sha256":"46ec33a9a481b2e4b2ffd8fdc5b72e90be30c33ead0e948bec45925b609315a3","abstract_canon_sha256":"6e88d86d0e3da412e656db47fd6d3793c52c8723dbfcd176fae2cdb18e201ab3"},"schema_version":"1.0"},"canonical_sha256":"7491de0770b22c3ad902c1fdcbc570d980f5d698f1b2468377346d75b2a6ddc6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:44:28.070058Z","signature_b64":"zvJd23w+Zi3ClYHiLb9KBrsh3v9uOXbb+H6bUIO4ufHRi9i6T71yw2mp24fww3eZltiuCnASbMeCse7EYpeEAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7491de0770b22c3ad902c1fdcbc570d980f5d698f1b2468377346d75b2a6ddc6","last_reissued_at":"2026-05-17T23:44:28.069481Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:44:28.069481Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1906.00135","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-17T23:44:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"T5yvAQ2QjqZ9CE01RX71BF8lkT8rUc+kdrHtRrPngvO1lOXvcvSrUfMEPQ/np8V6Yq/KA8IJphCgbB3wzePHBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T05:25:14.407371Z"},"content_sha256":"76dab8f707a181039f7aa94e607748b5d7b76fd714d1373f7f78a6a49c0ba0d4","schema_version":"1.0","event_id":"sha256:76dab8f707a181039f7aa94e607748b5d7b76fd714d1373f7f78a6a49c0ba0d4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:OSI54B3QWIWDVWICYH64XRLQ3G","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Properties of Partial Dominating Sets of Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Benjamin M. Case, Renu C. Laskar, Soumendra Ganguly, Todd Fenstermacher","submitted_at":"2019-06-01T02:48:04Z","abstract_excerpt":"A set $S\\subseteq V$ is a dominating set of $G$ if every vertex in $V - S$ is adjacent to at least one vertex in $S$. The domination number $\\gamma(G)$ of $G$ equals the minimum cardinality of a dominating set $S$ in $G$; we say that such a set $S$ is a $\\gamma$-set. A generalization of this is partial domination which was introduced in 2017 by Case, Hedetniemi, Laskar, and Lipman [3,2] . In partial domination a set $S$ is a $p$-dominating set if it dominates a proportion $p$ of the vertices in $V$. The p-domination number $\\gamma_{p}(G)$ is the minimum cardinality of a $p$-dominating set in $"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.00135","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-17T23:44:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NX5L6kakhULqfLaR8z7KtGy/1BSBORp7UOz2JXL67lGwyn2UJx0ESwsB5lbiSSPvM5Xlz1OnxJAJOlQagy8pBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T05:25:14.407723Z"},"content_sha256":"afc0d4c6e6bd64ab07afe68e77a776a49d301227d984b7fad836629ffb8d436d","schema_version":"1.0","event_id":"sha256:afc0d4c6e6bd64ab07afe68e77a776a49d301227d984b7fad836629ffb8d436d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OSI54B3QWIWDVWICYH64XRLQ3G/bundle.json","state_url":"https://pith.science/pith/OSI54B3QWIWDVWICYH64XRLQ3G/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OSI54B3QWIWDVWICYH64XRLQ3G/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-02T05:25:14Z","links":{"resolver":"https://pith.science/pith/OSI54B3QWIWDVWICYH64XRLQ3G","bundle":"https://pith.science/pith/OSI54B3QWIWDVWICYH64XRLQ3G/bundle.json","state":"https://pith.science/pith/OSI54B3QWIWDVWICYH64XRLQ3G/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OSI54B3QWIWDVWICYH64XRLQ3G/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:OSI54B3QWIWDVWICYH64XRLQ3G","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":"6e88d86d0e3da412e656db47fd6d3793c52c8723dbfcd176fae2cdb18e201ab3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-06-01T02:48:04Z","title_canon_sha256":"46ec33a9a481b2e4b2ffd8fdc5b72e90be30c33ead0e948bec45925b609315a3"},"schema_version":"1.0","source":{"id":"1906.00135","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.00135","created_at":"2026-05-17T23:44:28Z"},{"alias_kind":"arxiv_version","alias_value":"1906.00135v1","created_at":"2026-05-17T23:44:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.00135","created_at":"2026-05-17T23:44:28Z"},{"alias_kind":"pith_short_12","alias_value":"OSI54B3QWIWD","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_16","alias_value":"OSI54B3QWIWDVWIC","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_8","alias_value":"OSI54B3Q","created_at":"2026-05-18T12:33:24Z"}],"graph_snapshots":[{"event_id":"sha256:afc0d4c6e6bd64ab07afe68e77a776a49d301227d984b7fad836629ffb8d436d","target":"graph","created_at":"2026-05-17T23:44:28Z","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 $S\\subseteq V$ is a dominating set of $G$ if every vertex in $V - S$ is adjacent to at least one vertex in $S$. The domination number $\\gamma(G)$ of $G$ equals the minimum cardinality of a dominating set $S$ in $G$; we say that such a set $S$ is a $\\gamma$-set. A generalization of this is partial domination which was introduced in 2017 by Case, Hedetniemi, Laskar, and Lipman [3,2] . In partial domination a set $S$ is a $p$-dominating set if it dominates a proportion $p$ of the vertices in $V$. The p-domination number $\\gamma_{p}(G)$ is the minimum cardinality of a $p$-dominating set in $","authors_text":"Benjamin M. Case, Renu C. Laskar, Soumendra Ganguly, Todd Fenstermacher","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-06-01T02:48:04Z","title":"Properties of Partial Dominating Sets of Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.00135","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:76dab8f707a181039f7aa94e607748b5d7b76fd714d1373f7f78a6a49c0ba0d4","target":"record","created_at":"2026-05-17T23:44:28Z","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":"6e88d86d0e3da412e656db47fd6d3793c52c8723dbfcd176fae2cdb18e201ab3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-06-01T02:48:04Z","title_canon_sha256":"46ec33a9a481b2e4b2ffd8fdc5b72e90be30c33ead0e948bec45925b609315a3"},"schema_version":"1.0","source":{"id":"1906.00135","kind":"arxiv","version":1}},"canonical_sha256":"7491de0770b22c3ad902c1fdcbc570d980f5d698f1b2468377346d75b2a6ddc6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7491de0770b22c3ad902c1fdcbc570d980f5d698f1b2468377346d75b2a6ddc6","first_computed_at":"2026-05-17T23:44:28.069481Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:44:28.069481Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zvJd23w+Zi3ClYHiLb9KBrsh3v9uOXbb+H6bUIO4ufHRi9i6T71yw2mp24fww3eZltiuCnASbMeCse7EYpeEAw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:44:28.070058Z","signed_message":"canonical_sha256_bytes"},"source_id":"1906.00135","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:76dab8f707a181039f7aa94e607748b5d7b76fd714d1373f7f78a6a49c0ba0d4","sha256:afc0d4c6e6bd64ab07afe68e77a776a49d301227d984b7fad836629ffb8d436d"],"state_sha256":"1bbbfb932f6e6dc63c836b64067164f1d55dcbcc41da6d0a585e3c937c1bc4ab"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sZW3DDNmDsrvXPKCz/Qq3awSGQM3FQRctgIi9DMKAIzvAiHn33Z0ezDM+Qdguwo2ugqO2v/79j+qLjA5V3YHDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T05:25:14.409711Z","bundle_sha256":"fa91a78cf66bdf8ecad4a24507ca75b7f26ec06ffd8918f7d5f68579b71ded03"}}