{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:T7YMNMHFBXG62W2QZ5DPV3GAXI","short_pith_number":"pith:T7YMNMHF","schema_version":"1.0","canonical_sha256":"9ff0c6b0e50dcded5b50cf46faecc0ba30f9464386f65223c5700b6b356a76de","source":{"kind":"arxiv","id":"1805.02994","version":1},"attestation_state":"computed","paper":{"title":"Online Connected Dominating Set Leasing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Christine Markarian","submitted_at":"2018-05-07T10:48:30Z","abstract_excerpt":"We introduce the \\emph{Online Connected Dominating Set Leasing} problem (OCDSL) in which we are given an undirected connected graph $G = (V, E)$, a set $\\mathcal{L}$ of lease types each characterized by a duration and cost, and a sequence of subsets of $V$ arriving over time. A node can be leased using lease type $l$ for cost $c_l$ and remains active for time $d_l$. The adversary gives in each step $t$ a subset of nodes that need to be dominated by a connected subgraph consisting of nodes active at time $t$. The goal is to minimize the total leasing costs. OCDSL contains the \\emph{Parking Perm"},"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":"1805.02994","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-05-07T10:48:30Z","cross_cats_sorted":[],"title_canon_sha256":"e96ec09211f5f8eae3af71d4dc82e04e87ae206f9b5cb9e18d9df97a0fa40541","abstract_canon_sha256":"4ac9b376ed3ad129bcbb8b77b8f79c84a9c2c95895f461e894e51b4821985990"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:16:34.958935Z","signature_b64":"/VRpGmhXII9WAy5K8I2Ub+P07vIyrSzYuVVA3dRiJ3Wb+ObAp2AdJNu/xCVl/0SgBcNTR5RzsMdWyfKxscDVAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9ff0c6b0e50dcded5b50cf46faecc0ba30f9464386f65223c5700b6b356a76de","last_reissued_at":"2026-05-18T00:16:34.958385Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:16:34.958385Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Online Connected Dominating Set Leasing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Christine Markarian","submitted_at":"2018-05-07T10:48:30Z","abstract_excerpt":"We introduce the \\emph{Online Connected Dominating Set Leasing} problem (OCDSL) in which we are given an undirected connected graph $G = (V, E)$, a set $\\mathcal{L}$ of lease types each characterized by a duration and cost, and a sequence of subsets of $V$ arriving over time. A node can be leased using lease type $l$ for cost $c_l$ and remains active for time $d_l$. The adversary gives in each step $t$ a subset of nodes that need to be dominated by a connected subgraph consisting of nodes active at time $t$. The goal is to minimize the total leasing costs. OCDSL contains the \\emph{Parking Perm"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.02994","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1805.02994","created_at":"2026-05-18T00:16:34.958487+00:00"},{"alias_kind":"arxiv_version","alias_value":"1805.02994v1","created_at":"2026-05-18T00:16:34.958487+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.02994","created_at":"2026-05-18T00:16:34.958487+00:00"},{"alias_kind":"pith_short_12","alias_value":"T7YMNMHFBXG6","created_at":"2026-05-18T12:32:53.628368+00:00"},{"alias_kind":"pith_short_16","alias_value":"T7YMNMHFBXG62W2Q","created_at":"2026-05-18T12:32:53.628368+00:00"},{"alias_kind":"pith_short_8","alias_value":"T7YMNMHF","created_at":"2026-05-18T12:32:53.628368+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/T7YMNMHFBXG62W2QZ5DPV3GAXI","json":"https://pith.science/pith/T7YMNMHFBXG62W2QZ5DPV3GAXI.json","graph_json":"https://pith.science/api/pith-number/T7YMNMHFBXG62W2QZ5DPV3GAXI/graph.json","events_json":"https://pith.science/api/pith-number/T7YMNMHFBXG62W2QZ5DPV3GAXI/events.json","paper":"https://pith.science/paper/T7YMNMHF"},"agent_actions":{"view_html":"https://pith.science/pith/T7YMNMHFBXG62W2QZ5DPV3GAXI","download_json":"https://pith.science/pith/T7YMNMHFBXG62W2QZ5DPV3GAXI.json","view_paper":"https://pith.science/paper/T7YMNMHF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1805.02994&json=true","fetch_graph":"https://pith.science/api/pith-number/T7YMNMHFBXG62W2QZ5DPV3GAXI/graph.json","fetch_events":"https://pith.science/api/pith-number/T7YMNMHFBXG62W2QZ5DPV3GAXI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/T7YMNMHFBXG62W2QZ5DPV3GAXI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/T7YMNMHFBXG62W2QZ5DPV3GAXI/action/storage_attestation","attest_author":"https://pith.science/pith/T7YMNMHFBXG62W2QZ5DPV3GAXI/action/author_attestation","sign_citation":"https://pith.science/pith/T7YMNMHFBXG62W2QZ5DPV3GAXI/action/citation_signature","submit_replication":"https://pith.science/pith/T7YMNMHFBXG62W2QZ5DPV3GAXI/action/replication_record"}},"created_at":"2026-05-18T00:16:34.958487+00:00","updated_at":"2026-05-18T00:16:34.958487+00:00"}