{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:EC2FCFCJMBTNU5ADEGP6YURD5P","short_pith_number":"pith:EC2FCFCJ","schema_version":"1.0","canonical_sha256":"20b45114496066da7403219fec5223ebe0ec6697d4fbe8982e12b2f1eac037b7","source":{"kind":"arxiv","id":"1611.08809","version":1},"attestation_state":"computed","paper":{"title":"Fixed-Parameter Algorithms for DAG Partitioning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.SI"],"primary_cat":"cs.DS","authors_text":"Andr\\'e Nichterlein, Falk H\\\"uffner, Morgan Chopin, Ond\\v{r}ej Such\\'y, Ren\\'e van Bevern, Robert Bredereck, Sepp Hartung","submitted_at":"2016-11-27T09:04:03Z","abstract_excerpt":"Finding the origin of short phrases propagating through the web has been formalized by Leskovec et al. [ACM SIGKDD 2009] as DAG Partitioning: given an arc-weighted directed acyclic graph on $n$ vertices and $m$ arcs, delete arcs with total weight at most $k$ such that each resulting weakly-connected component contains exactly one sink---a vertex without outgoing arcs. DAG Partitioning is NP-hard.\n  We show an algorithm to solve DAG Partitioning in $O(2^k \\cdot (n+m))$ time, that is, in linear time for fixed $k$. We complement it with linear-time executable data reduction rules. Our experiments"},"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":"1611.08809","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-11-27T09:04:03Z","cross_cats_sorted":["cs.DM","cs.SI"],"title_canon_sha256":"422c5f9675cfcb7e6d8102a00ce8b8b30062025a801b17b49e235436d388629c","abstract_canon_sha256":"6c867bae5a9e6e77ec7aab2e4b74cc5ad4217d54e01439b4b0c7aca6cd2c05d0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:51:37.033259Z","signature_b64":"HDX3JFA7OGKkP5S8qt+d+L+p1YxIrPoDZf/0IV/I08D0c7EiXEkmj8BgVKabSiPmzfeZMf/j5AIgHkxbW7+lCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"20b45114496066da7403219fec5223ebe0ec6697d4fbe8982e12b2f1eac037b7","last_reissued_at":"2026-05-18T00:51:37.032913Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:51:37.032913Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fixed-Parameter Algorithms for DAG Partitioning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.SI"],"primary_cat":"cs.DS","authors_text":"Andr\\'e Nichterlein, Falk H\\\"uffner, Morgan Chopin, Ond\\v{r}ej Such\\'y, Ren\\'e van Bevern, Robert Bredereck, Sepp Hartung","submitted_at":"2016-11-27T09:04:03Z","abstract_excerpt":"Finding the origin of short phrases propagating through the web has been formalized by Leskovec et al. [ACM SIGKDD 2009] as DAG Partitioning: given an arc-weighted directed acyclic graph on $n$ vertices and $m$ arcs, delete arcs with total weight at most $k$ such that each resulting weakly-connected component contains exactly one sink---a vertex without outgoing arcs. DAG Partitioning is NP-hard.\n  We show an algorithm to solve DAG Partitioning in $O(2^k \\cdot (n+m))$ time, that is, in linear time for fixed $k$. We complement it with linear-time executable data reduction rules. Our experiments"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.08809","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":"1611.08809","created_at":"2026-05-18T00:51:37.032967+00:00"},{"alias_kind":"arxiv_version","alias_value":"1611.08809v1","created_at":"2026-05-18T00:51:37.032967+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.08809","created_at":"2026-05-18T00:51:37.032967+00:00"},{"alias_kind":"pith_short_12","alias_value":"EC2FCFCJMBTN","created_at":"2026-05-18T12:30:12.583610+00:00"},{"alias_kind":"pith_short_16","alias_value":"EC2FCFCJMBTNU5AD","created_at":"2026-05-18T12:30:12.583610+00:00"},{"alias_kind":"pith_short_8","alias_value":"EC2FCFCJ","created_at":"2026-05-18T12:30:12.583610+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/EC2FCFCJMBTNU5ADEGP6YURD5P","json":"https://pith.science/pith/EC2FCFCJMBTNU5ADEGP6YURD5P.json","graph_json":"https://pith.science/api/pith-number/EC2FCFCJMBTNU5ADEGP6YURD5P/graph.json","events_json":"https://pith.science/api/pith-number/EC2FCFCJMBTNU5ADEGP6YURD5P/events.json","paper":"https://pith.science/paper/EC2FCFCJ"},"agent_actions":{"view_html":"https://pith.science/pith/EC2FCFCJMBTNU5ADEGP6YURD5P","download_json":"https://pith.science/pith/EC2FCFCJMBTNU5ADEGP6YURD5P.json","view_paper":"https://pith.science/paper/EC2FCFCJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1611.08809&json=true","fetch_graph":"https://pith.science/api/pith-number/EC2FCFCJMBTNU5ADEGP6YURD5P/graph.json","fetch_events":"https://pith.science/api/pith-number/EC2FCFCJMBTNU5ADEGP6YURD5P/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EC2FCFCJMBTNU5ADEGP6YURD5P/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EC2FCFCJMBTNU5ADEGP6YURD5P/action/storage_attestation","attest_author":"https://pith.science/pith/EC2FCFCJMBTNU5ADEGP6YURD5P/action/author_attestation","sign_citation":"https://pith.science/pith/EC2FCFCJMBTNU5ADEGP6YURD5P/action/citation_signature","submit_replication":"https://pith.science/pith/EC2FCFCJMBTNU5ADEGP6YURD5P/action/replication_record"}},"created_at":"2026-05-18T00:51:37.032967+00:00","updated_at":"2026-05-18T00:51:37.032967+00:00"}