{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:2BKII75VOO37VOMWPGK77KWMHE","short_pith_number":"pith:2BKII75V","canonical_record":{"source":{"id":"1305.4308","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-05-19T00:10:34Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"14c8a27e22c820b164b8281527f1777f8e6a34882261952cd6349e316b6eec09","abstract_canon_sha256":"c74367ed873f3b2b154b4235166e49d08b942660d45704655b4a1db428cfb086"},"schema_version":"1.0"},"canonical_sha256":"d054847fb573b7fab9967995ffaacc392804b0d9fe743d8989303315e2cc7d54","source":{"kind":"arxiv","id":"1305.4308","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.4308","created_at":"2026-05-18T03:19:03Z"},{"alias_kind":"arxiv_version","alias_value":"1305.4308v2","created_at":"2026-05-18T03:19:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.4308","created_at":"2026-05-18T03:19:03Z"},{"alias_kind":"pith_short_12","alias_value":"2BKII75VOO37","created_at":"2026-05-18T12:27:30Z"},{"alias_kind":"pith_short_16","alias_value":"2BKII75VOO37VOMW","created_at":"2026-05-18T12:27:30Z"},{"alias_kind":"pith_short_8","alias_value":"2BKII75V","created_at":"2026-05-18T12:27:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:2BKII75VOO37VOMWPGK77KWMHE","target":"record","payload":{"canonical_record":{"source":{"id":"1305.4308","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-05-19T00:10:34Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"14c8a27e22c820b164b8281527f1777f8e6a34882261952cd6349e316b6eec09","abstract_canon_sha256":"c74367ed873f3b2b154b4235166e49d08b942660d45704655b4a1db428cfb086"},"schema_version":"1.0"},"canonical_sha256":"d054847fb573b7fab9967995ffaacc392804b0d9fe743d8989303315e2cc7d54","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:19:03.976057Z","signature_b64":"jPhRZJOzvls40YLC07MQVFW/YGmn9nV5vbp30kSE78nsFou9bbSKhGCQEensi5+BuwA/LQEDHRmwdwOnrPYlCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d054847fb573b7fab9967995ffaacc392804b0d9fe743d8989303315e2cc7d54","last_reissued_at":"2026-05-18T03:19:03.975492Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:19:03.975492Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1305.4308","source_version":2,"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-18T03:19:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GUiKhL9HvX06NHy00d12zguvwZp9uLkPHOlAN8WEgdKamw6Jlq+OnWZto4pIdyYvXI9Rk0YRIKL4uef18DMEAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T07:52:47.674231Z"},"content_sha256":"b02c9f7fd63600dbfa23b627a987081455fb7eef03636c2787bac18bc0c81f5a","schema_version":"1.0","event_id":"sha256:b02c9f7fd63600dbfa23b627a987081455fb7eef03636c2787bac18bc0c81f5a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:2BKII75VOO37VOMWPGK77KWMHE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Connected Domatic Packings in Node-capacitated Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Alina Ene, Ali Vakilian, Nitish Korula","submitted_at":"2013-05-19T00:10:34Z","abstract_excerpt":"A set of vertices in a graph is a dominating set if every vertex outside the set has a neighbor in the set. A dominating set is connected if the subgraph induced by its vertices is connected. The connected domatic partition problem asks for a partition of the nodes into connected dominating sets. The connected domatic number of a graph is the size of a largest connected domatic partition and it is a well-studied graph parameter with applications in the design of wireless networks. In this note, we consider the fractional counterpart of the connected domatic partition problem in \\emph{node-capa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.4308","kind":"arxiv","version":2},"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-18T03:19:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ENfPd71C9VmoVNTAzrZchSs3rDJveD2zOmghCaIQk+jzdMoJ9+7zUzXNHoE+EGPevvwkiW99L4uRbuAU+unZDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T07:52:47.674969Z"},"content_sha256":"a52e0f20bb0bd4179a4c46503f31d3ea78990597789267142b9ac56aac03dc04","schema_version":"1.0","event_id":"sha256:a52e0f20bb0bd4179a4c46503f31d3ea78990597789267142b9ac56aac03dc04"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2BKII75VOO37VOMWPGK77KWMHE/bundle.json","state_url":"https://pith.science/pith/2BKII75VOO37VOMWPGK77KWMHE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2BKII75VOO37VOMWPGK77KWMHE/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-26T07:52:47Z","links":{"resolver":"https://pith.science/pith/2BKII75VOO37VOMWPGK77KWMHE","bundle":"https://pith.science/pith/2BKII75VOO37VOMWPGK77KWMHE/bundle.json","state":"https://pith.science/pith/2BKII75VOO37VOMWPGK77KWMHE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2BKII75VOO37VOMWPGK77KWMHE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:2BKII75VOO37VOMWPGK77KWMHE","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":"c74367ed873f3b2b154b4235166e49d08b942660d45704655b4a1db428cfb086","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-05-19T00:10:34Z","title_canon_sha256":"14c8a27e22c820b164b8281527f1777f8e6a34882261952cd6349e316b6eec09"},"schema_version":"1.0","source":{"id":"1305.4308","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.4308","created_at":"2026-05-18T03:19:03Z"},{"alias_kind":"arxiv_version","alias_value":"1305.4308v2","created_at":"2026-05-18T03:19:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.4308","created_at":"2026-05-18T03:19:03Z"},{"alias_kind":"pith_short_12","alias_value":"2BKII75VOO37","created_at":"2026-05-18T12:27:30Z"},{"alias_kind":"pith_short_16","alias_value":"2BKII75VOO37VOMW","created_at":"2026-05-18T12:27:30Z"},{"alias_kind":"pith_short_8","alias_value":"2BKII75V","created_at":"2026-05-18T12:27:30Z"}],"graph_snapshots":[{"event_id":"sha256:a52e0f20bb0bd4179a4c46503f31d3ea78990597789267142b9ac56aac03dc04","target":"graph","created_at":"2026-05-18T03:19:03Z","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 of vertices in a graph is a dominating set if every vertex outside the set has a neighbor in the set. A dominating set is connected if the subgraph induced by its vertices is connected. The connected domatic partition problem asks for a partition of the nodes into connected dominating sets. The connected domatic number of a graph is the size of a largest connected domatic partition and it is a well-studied graph parameter with applications in the design of wireless networks. In this note, we consider the fractional counterpart of the connected domatic partition problem in \\emph{node-capa","authors_text":"Alina Ene, Ali Vakilian, Nitish Korula","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-05-19T00:10:34Z","title":"Connected Domatic Packings in Node-capacitated Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.4308","kind":"arxiv","version":2},"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:b02c9f7fd63600dbfa23b627a987081455fb7eef03636c2787bac18bc0c81f5a","target":"record","created_at":"2026-05-18T03:19:03Z","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":"c74367ed873f3b2b154b4235166e49d08b942660d45704655b4a1db428cfb086","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-05-19T00:10:34Z","title_canon_sha256":"14c8a27e22c820b164b8281527f1777f8e6a34882261952cd6349e316b6eec09"},"schema_version":"1.0","source":{"id":"1305.4308","kind":"arxiv","version":2}},"canonical_sha256":"d054847fb573b7fab9967995ffaacc392804b0d9fe743d8989303315e2cc7d54","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d054847fb573b7fab9967995ffaacc392804b0d9fe743d8989303315e2cc7d54","first_computed_at":"2026-05-18T03:19:03.975492Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:19:03.975492Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jPhRZJOzvls40YLC07MQVFW/YGmn9nV5vbp30kSE78nsFou9bbSKhGCQEensi5+BuwA/LQEDHRmwdwOnrPYlCg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:19:03.976057Z","signed_message":"canonical_sha256_bytes"},"source_id":"1305.4308","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b02c9f7fd63600dbfa23b627a987081455fb7eef03636c2787bac18bc0c81f5a","sha256:a52e0f20bb0bd4179a4c46503f31d3ea78990597789267142b9ac56aac03dc04"],"state_sha256":"6b776b6a5d369157225783847d28d8852b7b436ee2c34ee7e83b71a29d2ed50c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OC4VTwABdyxGbwAazg6yRhki5I3PLdpDPDm7LzORrsItLBkF+r8l0X+1Q5r8JqbqL965beghOGQDqe5ZuJldCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T07:52:47.678816Z","bundle_sha256":"700381d38b7df70c4a7f73c3fd69b714bd57ce12e8f698563d65ba4b9a571265"}}