{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:IX3SP6TSHNBLXBKQ34VDFYH7JJ","short_pith_number":"pith:IX3SP6TS","schema_version":"1.0","canonical_sha256":"45f727fa723b42bb8550df2a32e0ff4a5acec3aeeed6a36d6ea3c3c9b7004c19","source":{"kind":"arxiv","id":"2306.06999","version":2},"attestation_state":"computed","paper":{"title":"Temporal Reachability Dominating Sets: contagion in temporal graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CC","math.CO"],"primary_cat":"cs.DM","authors_text":"David C. Kutner, Laura Larios-Jones","submitted_at":"2023-06-12T10:09:13Z","abstract_excerpt":"Given a population with dynamic pairwise connections, we ask if the entire population could be (indirectly) infected by a small group of $k$ initially infected individuals. We formalise this problem as the Temporal Reachability Dominating Set (TaRDiS}) problem on temporal graphs. We provide positive and negative parameterized complexity results in four different parameters: the number $k$ of initially infected, the lifetime $\\tau$ of the graph, the number of locally earliest edges in the graph, and the treewidth of the footprint graph $\\mathcal{G}_\\downarrow$.\n  We additionally introduce and s"},"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":"2306.06999","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DM","submitted_at":"2023-06-12T10:09:13Z","cross_cats_sorted":["cs.CC","math.CO"],"title_canon_sha256":"5cd7318d3dab33c3f96ebcccb5a991a5c13b664e22aad21baf736f7c61fc90f1","abstract_canon_sha256":"141b9fccf8bb0197c24b8d6bb915a75769954a0e5f456b55af6f9abe54d797f7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:14:48.842332Z","signature_b64":"a9GTf1FLQGlRyIgf/XCOqGN4zms0OVbx9luuuktt0PujqWvfybb6lBpYi87SVhXE/zFFhKXvdhY0OFI4jmhUBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"45f727fa723b42bb8550df2a32e0ff4a5acec3aeeed6a36d6ea3c3c9b7004c19","last_reissued_at":"2026-07-05T08:14:48.841939Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:14:48.841939Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Temporal Reachability Dominating Sets: contagion in temporal graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CC","math.CO"],"primary_cat":"cs.DM","authors_text":"David C. Kutner, Laura Larios-Jones","submitted_at":"2023-06-12T10:09:13Z","abstract_excerpt":"Given a population with dynamic pairwise connections, we ask if the entire population could be (indirectly) infected by a small group of $k$ initially infected individuals. We formalise this problem as the Temporal Reachability Dominating Set (TaRDiS}) problem on temporal graphs. We provide positive and negative parameterized complexity results in four different parameters: the number $k$ of initially infected, the lifetime $\\tau$ of the graph, the number of locally earliest edges in the graph, and the treewidth of the footprint graph $\\mathcal{G}_\\downarrow$.\n  We additionally introduce and s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2306.06999","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2306.06999/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2306.06999","created_at":"2026-07-05T08:14:48.841989+00:00"},{"alias_kind":"arxiv_version","alias_value":"2306.06999v2","created_at":"2026-07-05T08:14:48.841989+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2306.06999","created_at":"2026-07-05T08:14:48.841989+00:00"},{"alias_kind":"pith_short_12","alias_value":"IX3SP6TSHNBL","created_at":"2026-07-05T08:14:48.841989+00:00"},{"alias_kind":"pith_short_16","alias_value":"IX3SP6TSHNBLXBKQ","created_at":"2026-07-05T08:14:48.841989+00:00"},{"alias_kind":"pith_short_8","alias_value":"IX3SP6TS","created_at":"2026-07-05T08:14:48.841989+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2501.18987","citing_title":"Better late, then? The hardness of choosing delays to meet passenger demands in temporal graphs","ref_index":20,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/IX3SP6TSHNBLXBKQ34VDFYH7JJ","json":"https://pith.science/pith/IX3SP6TSHNBLXBKQ34VDFYH7JJ.json","graph_json":"https://pith.science/api/pith-number/IX3SP6TSHNBLXBKQ34VDFYH7JJ/graph.json","events_json":"https://pith.science/api/pith-number/IX3SP6TSHNBLXBKQ34VDFYH7JJ/events.json","paper":"https://pith.science/paper/IX3SP6TS"},"agent_actions":{"view_html":"https://pith.science/pith/IX3SP6TSHNBLXBKQ34VDFYH7JJ","download_json":"https://pith.science/pith/IX3SP6TSHNBLXBKQ34VDFYH7JJ.json","view_paper":"https://pith.science/paper/IX3SP6TS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2306.06999&json=true","fetch_graph":"https://pith.science/api/pith-number/IX3SP6TSHNBLXBKQ34VDFYH7JJ/graph.json","fetch_events":"https://pith.science/api/pith-number/IX3SP6TSHNBLXBKQ34VDFYH7JJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IX3SP6TSHNBLXBKQ34VDFYH7JJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IX3SP6TSHNBLXBKQ34VDFYH7JJ/action/storage_attestation","attest_author":"https://pith.science/pith/IX3SP6TSHNBLXBKQ34VDFYH7JJ/action/author_attestation","sign_citation":"https://pith.science/pith/IX3SP6TSHNBLXBKQ34VDFYH7JJ/action/citation_signature","submit_replication":"https://pith.science/pith/IX3SP6TSHNBLXBKQ34VDFYH7JJ/action/replication_record"}},"created_at":"2026-07-05T08:14:48.841989+00:00","updated_at":"2026-07-05T08:14:48.841989+00:00"}