{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:R4VVB7NN67D5EL2WCIFMRLK2SZ","short_pith_number":"pith:R4VVB7NN","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"},"canonical_sha256":"8f2b50fdadf7c7d22f56120ac8ad5a966c635e7c73096e0fb2136883a08a3e12","source":{"kind":"arxiv","id":"1706.00617","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.00617","created_at":"2026-05-18T00:43:12Z"},{"alias_kind":"arxiv_version","alias_value":"1706.00617v1","created_at":"2026-05-18T00:43:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.00617","created_at":"2026-05-18T00:43:12Z"},{"alias_kind":"pith_short_12","alias_value":"R4VVB7NN67D5","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_16","alias_value":"R4VVB7NN67D5EL2W","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_8","alias_value":"R4VVB7NN","created_at":"2026-05-18T12:31:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:R4VVB7NN67D5EL2WCIFMRLK2SZ","target":"record","payload":{"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"},"canonical_sha256":"8f2b50fdadf7c7d22f56120ac8ad5a966c635e7c73096e0fb2136883a08a3e12","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"},"source_kind":"arxiv","source_id":"1706.00617","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:43:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2dKh3y9780RIwDTWWwYgtL5X6mLr8/JghetQo3rgCns5zcKfruvCT398rz4rN71G4scOL2/ZM6mGZ4dygCZBDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T23:11:56.908208Z"},"content_sha256":"844b991d19bedff1e059eaaecc42cba6df98b0ae420710bb20259ac7a89a0d4a","schema_version":"1.0","event_id":"sha256:844b991d19bedff1e059eaaecc42cba6df98b0ae420710bb20259ac7a89a0d4a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:R4VVB7NN67D5EL2WCIFMRLK2SZ","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:43:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zUwIfvT2VJzyhxDw674LxAqZTzt5r9a/bIksbN3GEZl5SPKPkP3BKVTmu7InPhBg98qaOlSwstiRESwABdmTAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T23:11:56.908916Z"},"content_sha256":"5a309375879440c217b892f1ceaa24daeaf16c481477789ff3cabeb100afdfed","schema_version":"1.0","event_id":"sha256:5a309375879440c217b892f1ceaa24daeaf16c481477789ff3cabeb100afdfed"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/R4VVB7NN67D5EL2WCIFMRLK2SZ/bundle.json","state_url":"https://pith.science/pith/R4VVB7NN67D5EL2WCIFMRLK2SZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/R4VVB7NN67D5EL2WCIFMRLK2SZ/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-26T23:11:56Z","links":{"resolver":"https://pith.science/pith/R4VVB7NN67D5EL2WCIFMRLK2SZ","bundle":"https://pith.science/pith/R4VVB7NN67D5EL2WCIFMRLK2SZ/bundle.json","state":"https://pith.science/pith/R4VVB7NN67D5EL2WCIFMRLK2SZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/R4VVB7NN67D5EL2WCIFMRLK2SZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:R4VVB7NN67D5EL2WCIFMRLK2SZ","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"d86e7b4d7ce164b2ce9e585ecc98e915850ca35eaccc4d1fbf1fed2223697f3b","cross_cats_sorted":["cs.CC","cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-06-02T10:23:12Z","title_canon_sha256":"20f2084a12c06454680a8fba5f5246436267eb41cfee91f18b5aca29ddeec86b"},"schema_version":"1.0","source":{"id":"1706.00617","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.00617","created_at":"2026-05-18T00:43:12Z"},{"alias_kind":"arxiv_version","alias_value":"1706.00617v1","created_at":"2026-05-18T00:43:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.00617","created_at":"2026-05-18T00:43:12Z"},{"alias_kind":"pith_short_12","alias_value":"R4VVB7NN67D5","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_16","alias_value":"R4VVB7NN67D5EL2W","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_8","alias_value":"R4VVB7NN","created_at":"2026-05-18T12:31:39Z"}],"graph_snapshots":[{"event_id":"sha256:5a309375879440c217b892f1ceaa24daeaf16c481477789ff3cabeb100afdfed","target":"graph","created_at":"2026-05-18T00:43:12Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Christophe Paul, Florian Barbero, Micha{\\l} Pilipczuk","cross_cats":["cs.CC","cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-06-02T10:23:12Z","title":"Exploring the complexity of layout parameters in tournaments and semi-complete digraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.00617","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:844b991d19bedff1e059eaaecc42cba6df98b0ae420710bb20259ac7a89a0d4a","target":"record","created_at":"2026-05-18T00:43:12Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"d86e7b4d7ce164b2ce9e585ecc98e915850ca35eaccc4d1fbf1fed2223697f3b","cross_cats_sorted":["cs.CC","cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-06-02T10:23:12Z","title_canon_sha256":"20f2084a12c06454680a8fba5f5246436267eb41cfee91f18b5aca29ddeec86b"},"schema_version":"1.0","source":{"id":"1706.00617","kind":"arxiv","version":1}},"canonical_sha256":"8f2b50fdadf7c7d22f56120ac8ad5a966c635e7c73096e0fb2136883a08a3e12","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8f2b50fdadf7c7d22f56120ac8ad5a966c635e7c73096e0fb2136883a08a3e12","first_computed_at":"2026-05-18T00:43:12.525024Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:43:12.525024Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5Z1S9IXvPxMnbZlpjZfJ+fJzrjBSU2zIwe9ngLp3JAwwLSt3aWpAgjZW/T8VofxtntYPG8rXgY1d+vNhZvbmAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:43:12.525545Z","signed_message":"canonical_sha256_bytes"},"source_id":"1706.00617","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:844b991d19bedff1e059eaaecc42cba6df98b0ae420710bb20259ac7a89a0d4a","sha256:5a309375879440c217b892f1ceaa24daeaf16c481477789ff3cabeb100afdfed"],"state_sha256":"2fc943aced2c13b7792c80780b2dd4541982a5d753e83b0557dcf7e9f1b0634a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8JtivEbH+dOMnc+PiF51z0KRtGhyXwqAZcsyPrfrB3gHatHAkP0/0fOV+2VJy/5eQ9WuQE2NuzgodiLUlX8UDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T23:11:56.912645Z","bundle_sha256":"d4943ed223940e37e32bc5a15fbaeae9f4be489ec51e6f57089b23de5896569f"}}