{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:FAT6LCGX6AA3R7FEKYBTJCZP2P","short_pith_number":"pith:FAT6LCGX","canonical_record":{"source":{"id":"1705.03096","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-05-08T21:32:44Z","cross_cats_sorted":[],"title_canon_sha256":"e0ae23d31341bf8f4499f50d818fd7612b04cd8a69a6a95c7190b17c785a52ea","abstract_canon_sha256":"5b840accf84f3e0ed4b33e930662f5e669bc4e871f40b5896bb27c3349aed967"},"schema_version":"1.0"},"canonical_sha256":"2827e588d7f001b8fca45603348b2fd3e512476f3be8ea4e7170575e7bf27792","source":{"kind":"arxiv","id":"1705.03096","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.03096","created_at":"2026-05-18T00:44:50Z"},{"alias_kind":"arxiv_version","alias_value":"1705.03096v1","created_at":"2026-05-18T00:44:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.03096","created_at":"2026-05-18T00:44:50Z"},{"alias_kind":"pith_short_12","alias_value":"FAT6LCGX6AA3","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_16","alias_value":"FAT6LCGX6AA3R7FE","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_8","alias_value":"FAT6LCGX","created_at":"2026-05-18T12:31:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:FAT6LCGX6AA3R7FEKYBTJCZP2P","target":"record","payload":{"canonical_record":{"source":{"id":"1705.03096","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-05-08T21:32:44Z","cross_cats_sorted":[],"title_canon_sha256":"e0ae23d31341bf8f4499f50d818fd7612b04cd8a69a6a95c7190b17c785a52ea","abstract_canon_sha256":"5b840accf84f3e0ed4b33e930662f5e669bc4e871f40b5896bb27c3349aed967"},"schema_version":"1.0"},"canonical_sha256":"2827e588d7f001b8fca45603348b2fd3e512476f3be8ea4e7170575e7bf27792","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:44:50.724171Z","signature_b64":"H3nNbUwd2rCCEk1N6nxRRggh6ye9aLm6XptUgZPv9v/bKuI9+pLPWfdcXZXo5ZM9cb6LCoBCYahumYJCfUz9Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2827e588d7f001b8fca45603348b2fd3e512476f3be8ea4e7170575e7bf27792","last_reissued_at":"2026-05-18T00:44:50.723531Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:44:50.723531Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1705.03096","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:44:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PsDJ/vUykXe3w8YxBJzVkSPvK5mf3HnwGcxJV3Y/H9hG37oXkCi85+3MBuuWaBGlikEv1TDWbPxHY6nPdtckDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T20:43:37.627445Z"},"content_sha256":"1bbd0bf534a7208a7ee9916b5fea7153b8794d74769aac4352dd8812b768b492","schema_version":"1.0","event_id":"sha256:1bbd0bf534a7208a7ee9916b5fea7153b8794d74769aac4352dd8812b768b492"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:FAT6LCGX6AA3R7FEKYBTJCZP2P","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Partial Domination in Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Benjamin M. Case, Drew J. Lipman, Renu C. Laskar, Stephen T. Hedetniemi","submitted_at":"2017-05-08T21:32:44Z","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. The single greatest focus of research in domination theory is the determination of the value of $\\gamma(G)$. By definition, all vertices must be dominated by a $\\gamma$-set. In this paper we propose relaxing this requirement, by seeking sets of vertices that dominate a prescribed fraction of the vertices of a graph. We focus parti"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.03096","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:44:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fbvUg5AS0aTEoj2+fWmJ76RdI20oWflYCLRvegFlCgrLYgo3zuaTpOvVlDOIDEA/g1ws52/jEQXKqz8njBC7Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T20:43:37.628100Z"},"content_sha256":"6b5294fbfb49a60b17ce2f2f886903f4fb33d4c058826c206206bd812e3ad9c3","schema_version":"1.0","event_id":"sha256:6b5294fbfb49a60b17ce2f2f886903f4fb33d4c058826c206206bd812e3ad9c3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FAT6LCGX6AA3R7FEKYBTJCZP2P/bundle.json","state_url":"https://pith.science/pith/FAT6LCGX6AA3R7FEKYBTJCZP2P/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FAT6LCGX6AA3R7FEKYBTJCZP2P/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-11T20:43:37Z","links":{"resolver":"https://pith.science/pith/FAT6LCGX6AA3R7FEKYBTJCZP2P","bundle":"https://pith.science/pith/FAT6LCGX6AA3R7FEKYBTJCZP2P/bundle.json","state":"https://pith.science/pith/FAT6LCGX6AA3R7FEKYBTJCZP2P/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FAT6LCGX6AA3R7FEKYBTJCZP2P/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:FAT6LCGX6AA3R7FEKYBTJCZP2P","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":"5b840accf84f3e0ed4b33e930662f5e669bc4e871f40b5896bb27c3349aed967","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-05-08T21:32:44Z","title_canon_sha256":"e0ae23d31341bf8f4499f50d818fd7612b04cd8a69a6a95c7190b17c785a52ea"},"schema_version":"1.0","source":{"id":"1705.03096","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.03096","created_at":"2026-05-18T00:44:50Z"},{"alias_kind":"arxiv_version","alias_value":"1705.03096v1","created_at":"2026-05-18T00:44:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.03096","created_at":"2026-05-18T00:44:50Z"},{"alias_kind":"pith_short_12","alias_value":"FAT6LCGX6AA3","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_16","alias_value":"FAT6LCGX6AA3R7FE","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_8","alias_value":"FAT6LCGX","created_at":"2026-05-18T12:31:15Z"}],"graph_snapshots":[{"event_id":"sha256:6b5294fbfb49a60b17ce2f2f886903f4fb33d4c058826c206206bd812e3ad9c3","target":"graph","created_at":"2026-05-18T00:44:50Z","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. The single greatest focus of research in domination theory is the determination of the value of $\\gamma(G)$. By definition, all vertices must be dominated by a $\\gamma$-set. In this paper we propose relaxing this requirement, by seeking sets of vertices that dominate a prescribed fraction of the vertices of a graph. We focus parti","authors_text":"Benjamin M. Case, Drew J. Lipman, Renu C. Laskar, Stephen T. Hedetniemi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-05-08T21:32:44Z","title":"Partial Domination in Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.03096","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:1bbd0bf534a7208a7ee9916b5fea7153b8794d74769aac4352dd8812b768b492","target":"record","created_at":"2026-05-18T00:44:50Z","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":"5b840accf84f3e0ed4b33e930662f5e669bc4e871f40b5896bb27c3349aed967","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-05-08T21:32:44Z","title_canon_sha256":"e0ae23d31341bf8f4499f50d818fd7612b04cd8a69a6a95c7190b17c785a52ea"},"schema_version":"1.0","source":{"id":"1705.03096","kind":"arxiv","version":1}},"canonical_sha256":"2827e588d7f001b8fca45603348b2fd3e512476f3be8ea4e7170575e7bf27792","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2827e588d7f001b8fca45603348b2fd3e512476f3be8ea4e7170575e7bf27792","first_computed_at":"2026-05-18T00:44:50.723531Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:44:50.723531Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"H3nNbUwd2rCCEk1N6nxRRggh6ye9aLm6XptUgZPv9v/bKuI9+pLPWfdcXZXo5ZM9cb6LCoBCYahumYJCfUz9Dw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:44:50.724171Z","signed_message":"canonical_sha256_bytes"},"source_id":"1705.03096","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1bbd0bf534a7208a7ee9916b5fea7153b8794d74769aac4352dd8812b768b492","sha256:6b5294fbfb49a60b17ce2f2f886903f4fb33d4c058826c206206bd812e3ad9c3"],"state_sha256":"141d79d4e866f122b30a1511b8fea9cd8c840612d4b55b0db320e12cb5b64450"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CnKwCm18GkCv2nn4d2PG6+ptR1wHsoUHY44gJvnYawQHAZIeBCVKYzkBdXm7qwDX0+x2uRa8UW84lRLLDmBoDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T20:43:37.631837Z","bundle_sha256":"7e7156de96ecc753897c293f2217de1c5300a0ac73c8cb76efc094abbbc093e3"}}