{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:GJUICQ3NX53QLB3OSUIXE4PUN3","short_pith_number":"pith:GJUICQ3N","schema_version":"1.0","canonical_sha256":"326881436dbf7705876e95117271f46ede1fa59e4e3cad72a22036e6b5c0ccaf","source":{"kind":"arxiv","id":"1902.04919","version":6},"attestation_state":"computed","paper":{"title":"New Results on Directed Edge Dominating Set","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Eun Jung Kim, Ioannis Katsikarelis, Michael Lampis, R\\'emy Belmonte, Tesshu Hanaka","submitted_at":"2019-02-13T14:30:41Z","abstract_excerpt":"We study a family of generalizations of Edge Dominating Set on directed graphs called Directed $(p,q)$-Edge Dominating Set. In this problem an arc $(u,v)$ is said to dominate itself, as well as all arcs which are at distance at most $q$ from $v$, or at distance at most $p$ to $u$.\n  First, we give significantly improved FPT algorithms for the two most important cases of the problem, $(0,1)$-dEDS and $(1,1)$-dEDS (that correspond to versions of Dominating Set on line graphs), as well as polynomial kernels. We also improve the best-known approximation for these cases from logarithmic to constant"},"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":"1902.04919","kind":"arxiv","version":6},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2019-02-13T14:30:41Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"1bdeeba1d01cf9626b911df710da94719a7e312a477282198d29d1c356146c36","abstract_canon_sha256":"be9d87857b239bb1f23c2bf1e5e3a1618cfd9460f4cf11061f6bfebb9215379e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:22:50.849384Z","signature_b64":"Z8gMGsbFpNCmObAmGLIVcTAHntC0qN0FxDQBghyWD0xLeQoWYvL3S1xwkm5SoJkZn/Di6VXrUKylbfJlGxv4Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"326881436dbf7705876e95117271f46ede1fa59e4e3cad72a22036e6b5c0ccaf","last_reissued_at":"2026-07-05T06:22:50.848988Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:22:50.848988Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"New Results on Directed Edge Dominating Set","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Eun Jung Kim, Ioannis Katsikarelis, Michael Lampis, R\\'emy Belmonte, Tesshu Hanaka","submitted_at":"2019-02-13T14:30:41Z","abstract_excerpt":"We study a family of generalizations of Edge Dominating Set on directed graphs called Directed $(p,q)$-Edge Dominating Set. In this problem an arc $(u,v)$ is said to dominate itself, as well as all arcs which are at distance at most $q$ from $v$, or at distance at most $p$ to $u$.\n  First, we give significantly improved FPT algorithms for the two most important cases of the problem, $(0,1)$-dEDS and $(1,1)$-dEDS (that correspond to versions of Dominating Set on line graphs), as well as polynomial kernels. We also improve the best-known approximation for these cases from logarithmic to constant"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.04919","kind":"arxiv","version":6},"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/1902.04919/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":"1902.04919","created_at":"2026-07-05T06:22:50.849044+00:00"},{"alias_kind":"arxiv_version","alias_value":"1902.04919v6","created_at":"2026-07-05T06:22:50.849044+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.04919","created_at":"2026-07-05T06:22:50.849044+00:00"},{"alias_kind":"pith_short_12","alias_value":"GJUICQ3NX53Q","created_at":"2026-07-05T06:22:50.849044+00:00"},{"alias_kind":"pith_short_16","alias_value":"GJUICQ3NX53QLB3O","created_at":"2026-07-05T06:22:50.849044+00:00"},{"alias_kind":"pith_short_8","alias_value":"GJUICQ3N","created_at":"2026-07-05T06:22:50.849044+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/GJUICQ3NX53QLB3OSUIXE4PUN3","json":"https://pith.science/pith/GJUICQ3NX53QLB3OSUIXE4PUN3.json","graph_json":"https://pith.science/api/pith-number/GJUICQ3NX53QLB3OSUIXE4PUN3/graph.json","events_json":"https://pith.science/api/pith-number/GJUICQ3NX53QLB3OSUIXE4PUN3/events.json","paper":"https://pith.science/paper/GJUICQ3N"},"agent_actions":{"view_html":"https://pith.science/pith/GJUICQ3NX53QLB3OSUIXE4PUN3","download_json":"https://pith.science/pith/GJUICQ3NX53QLB3OSUIXE4PUN3.json","view_paper":"https://pith.science/paper/GJUICQ3N","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1902.04919&json=true","fetch_graph":"https://pith.science/api/pith-number/GJUICQ3NX53QLB3OSUIXE4PUN3/graph.json","fetch_events":"https://pith.science/api/pith-number/GJUICQ3NX53QLB3OSUIXE4PUN3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GJUICQ3NX53QLB3OSUIXE4PUN3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GJUICQ3NX53QLB3OSUIXE4PUN3/action/storage_attestation","attest_author":"https://pith.science/pith/GJUICQ3NX53QLB3OSUIXE4PUN3/action/author_attestation","sign_citation":"https://pith.science/pith/GJUICQ3NX53QLB3OSUIXE4PUN3/action/citation_signature","submit_replication":"https://pith.science/pith/GJUICQ3NX53QLB3OSUIXE4PUN3/action/replication_record"}},"created_at":"2026-07-05T06:22:50.849044+00:00","updated_at":"2026-07-05T06:22:50.849044+00:00"}