{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:R4VVB7NN67D5EL2WCIFMRLK2SZ","short_pith_number":"pith:R4VVB7NN","schema_version":"1.0","canonical_sha256":"8f2b50fdadf7c7d22f56120ac8ad5a966c635e7c73096e0fb2136883a08a3e12","source":{"kind":"arxiv","id":"1706.00617","version":1},"attestation_state":"computed","paper":{"title":"Exploring the complexity of layout parameters in tournaments and semi-complete digraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DM"],"primary_cat":"cs.DS","authors_text":"Christophe Paul, Florian Barbero, Micha{\\l} Pilipczuk","submitted_at":"2017-06-02T10:23:12Z","abstract_excerpt":"A simple digraph is semi-complete if for any two of its vertices $u$ and $v$, at least one of the arcs $(u,v)$ and $(v,u)$ is present. We study the complexity of computing two layout parameters of semi-complete digraphs: cutwidth and optimal linear arrangement (OLA). We prove that: (1) Both parameters are $\\mathsf{NP}$-hard to compute and the known exact and parameterized algorithms for them have essentially optimal running times, assuming the Exponential Time Hypothesis; (2) The cutwidth parameter admits a quadratic Turing kernel, whereas it does not admit any polynomial kernel unless $\\maths"},"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":"1706.00617","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-06-02T10:23:12Z","cross_cats_sorted":["cs.CC","cs.DM"],"title_canon_sha256":"20f2084a12c06454680a8fba5f5246436267eb41cfee91f18b5aca29ddeec86b","abstract_canon_sha256":"d86e7b4d7ce164b2ce9e585ecc98e915850ca35eaccc4d1fbf1fed2223697f3b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:43:12.525545Z","signature_b64":"5Z1S9IXvPxMnbZlpjZfJ+fJzrjBSU2zIwe9ngLp3JAwwLSt3aWpAgjZW/T8VofxtntYPG8rXgY1d+vNhZvbmAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8f2b50fdadf7c7d22f56120ac8ad5a966c635e7c73096e0fb2136883a08a3e12","last_reissued_at":"2026-05-18T00:43:12.525024Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:43:12.525024Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Exploring the complexity of layout parameters in tournaments and semi-complete digraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DM"],"primary_cat":"cs.DS","authors_text":"Christophe Paul, Florian Barbero, Micha{\\l} Pilipczuk","submitted_at":"2017-06-02T10:23:12Z","abstract_excerpt":"A simple digraph is semi-complete if for any two of its vertices $u$ and $v$, at least one of the arcs $(u,v)$ and $(v,u)$ is present. We study the complexity of computing two layout parameters of semi-complete digraphs: cutwidth and optimal linear arrangement (OLA). We prove that: (1) Both parameters are $\\mathsf{NP}$-hard to compute and the known exact and parameterized algorithms for them have essentially optimal running times, assuming the Exponential Time Hypothesis; (2) The cutwidth parameter admits a quadratic Turing kernel, whereas it does not admit any polynomial kernel unless $\\maths"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.00617","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":"1706.00617","created_at":"2026-05-18T00:43:12.525113+00:00"},{"alias_kind":"arxiv_version","alias_value":"1706.00617v1","created_at":"2026-05-18T00:43:12.525113+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.00617","created_at":"2026-05-18T00:43:12.525113+00:00"},{"alias_kind":"pith_short_12","alias_value":"R4VVB7NN67D5","created_at":"2026-05-18T12:31:39.905425+00:00"},{"alias_kind":"pith_short_16","alias_value":"R4VVB7NN67D5EL2W","created_at":"2026-05-18T12:31:39.905425+00:00"},{"alias_kind":"pith_short_8","alias_value":"R4VVB7NN","created_at":"2026-05-18T12:31:39.905425+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/R4VVB7NN67D5EL2WCIFMRLK2SZ","json":"https://pith.science/pith/R4VVB7NN67D5EL2WCIFMRLK2SZ.json","graph_json":"https://pith.science/api/pith-number/R4VVB7NN67D5EL2WCIFMRLK2SZ/graph.json","events_json":"https://pith.science/api/pith-number/R4VVB7NN67D5EL2WCIFMRLK2SZ/events.json","paper":"https://pith.science/paper/R4VVB7NN"},"agent_actions":{"view_html":"https://pith.science/pith/R4VVB7NN67D5EL2WCIFMRLK2SZ","download_json":"https://pith.science/pith/R4VVB7NN67D5EL2WCIFMRLK2SZ.json","view_paper":"https://pith.science/paper/R4VVB7NN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1706.00617&json=true","fetch_graph":"https://pith.science/api/pith-number/R4VVB7NN67D5EL2WCIFMRLK2SZ/graph.json","fetch_events":"https://pith.science/api/pith-number/R4VVB7NN67D5EL2WCIFMRLK2SZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/R4VVB7NN67D5EL2WCIFMRLK2SZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/R4VVB7NN67D5EL2WCIFMRLK2SZ/action/storage_attestation","attest_author":"https://pith.science/pith/R4VVB7NN67D5EL2WCIFMRLK2SZ/action/author_attestation","sign_citation":"https://pith.science/pith/R4VVB7NN67D5EL2WCIFMRLK2SZ/action/citation_signature","submit_replication":"https://pith.science/pith/R4VVB7NN67D5EL2WCIFMRLK2SZ/action/replication_record"}},"created_at":"2026-05-18T00:43:12.525113+00:00","updated_at":"2026-05-18T00:43:12.525113+00:00"}