{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:2BKII75VOO37VOMWPGK77KWMHE","short_pith_number":"pith:2BKII75V","schema_version":"1.0","canonical_sha256":"d054847fb573b7fab9967995ffaacc392804b0d9fe743d8989303315e2cc7d54","source":{"kind":"arxiv","id":"1305.4308","version":2},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1305.4308","created_at":"2026-05-18T03:19:03.975585+00:00"},{"alias_kind":"arxiv_version","alias_value":"1305.4308v2","created_at":"2026-05-18T03:19:03.975585+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.4308","created_at":"2026-05-18T03:19:03.975585+00:00"},{"alias_kind":"pith_short_12","alias_value":"2BKII75VOO37","created_at":"2026-05-18T12:27:30.460161+00:00"},{"alias_kind":"pith_short_16","alias_value":"2BKII75VOO37VOMW","created_at":"2026-05-18T12:27:30.460161+00:00"},{"alias_kind":"pith_short_8","alias_value":"2BKII75V","created_at":"2026-05-18T12:27:30.460161+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/2BKII75VOO37VOMWPGK77KWMHE","json":"https://pith.science/pith/2BKII75VOO37VOMWPGK77KWMHE.json","graph_json":"https://pith.science/api/pith-number/2BKII75VOO37VOMWPGK77KWMHE/graph.json","events_json":"https://pith.science/api/pith-number/2BKII75VOO37VOMWPGK77KWMHE/events.json","paper":"https://pith.science/paper/2BKII75V"},"agent_actions":{"view_html":"https://pith.science/pith/2BKII75VOO37VOMWPGK77KWMHE","download_json":"https://pith.science/pith/2BKII75VOO37VOMWPGK77KWMHE.json","view_paper":"https://pith.science/paper/2BKII75V","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1305.4308&json=true","fetch_graph":"https://pith.science/api/pith-number/2BKII75VOO37VOMWPGK77KWMHE/graph.json","fetch_events":"https://pith.science/api/pith-number/2BKII75VOO37VOMWPGK77KWMHE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2BKII75VOO37VOMWPGK77KWMHE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2BKII75VOO37VOMWPGK77KWMHE/action/storage_attestation","attest_author":"https://pith.science/pith/2BKII75VOO37VOMWPGK77KWMHE/action/author_attestation","sign_citation":"https://pith.science/pith/2BKII75VOO37VOMWPGK77KWMHE/action/citation_signature","submit_replication":"https://pith.science/pith/2BKII75VOO37VOMWPGK77KWMHE/action/replication_record"}},"created_at":"2026-05-18T03:19:03.975585+00:00","updated_at":"2026-05-18T03:19:03.975585+00:00"}