{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:AV6TZF4QKFR4UNYWZW3UC33VTG","short_pith_number":"pith:AV6TZF4Q","canonical_record":{"source":{"id":"1507.01934","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-07-07T19:55:36Z","cross_cats_sorted":[],"title_canon_sha256":"92efa9ebb78373794dd3d978fc64b3548907e1b7b810e627249e84acc20dda41","abstract_canon_sha256":"7b8dd572b3e7c22eaeaec9e92172f4237d8a7850a66f86ce6a60583292a4a78b"},"schema_version":"1.0"},"canonical_sha256":"057d3c97905163ca3716cdb7416f7599975dee08a46415899c8907f5c7b0dec0","source":{"kind":"arxiv","id":"1507.01934","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.01934","created_at":"2026-05-18T01:37:11Z"},{"alias_kind":"arxiv_version","alias_value":"1507.01934v1","created_at":"2026-05-18T01:37:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.01934","created_at":"2026-05-18T01:37:11Z"},{"alias_kind":"pith_short_12","alias_value":"AV6TZF4QKFR4","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_16","alias_value":"AV6TZF4QKFR4UNYW","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_8","alias_value":"AV6TZF4Q","created_at":"2026-05-18T12:29:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:AV6TZF4QKFR4UNYWZW3UC33VTG","target":"record","payload":{"canonical_record":{"source":{"id":"1507.01934","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-07-07T19:55:36Z","cross_cats_sorted":[],"title_canon_sha256":"92efa9ebb78373794dd3d978fc64b3548907e1b7b810e627249e84acc20dda41","abstract_canon_sha256":"7b8dd572b3e7c22eaeaec9e92172f4237d8a7850a66f86ce6a60583292a4a78b"},"schema_version":"1.0"},"canonical_sha256":"057d3c97905163ca3716cdb7416f7599975dee08a46415899c8907f5c7b0dec0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:37:11.964276Z","signature_b64":"CjrqXuRy7ENT7xRNEuDBT7UsLVLuYOU7mQVnL8nXoaF+zpnew/XpRn+6Y0WD/yPEKnb6IN41o9MoAi0Mp0TCBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"057d3c97905163ca3716cdb7416f7599975dee08a46415899c8907f5c7b0dec0","last_reissued_at":"2026-05-18T01:37:11.963415Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:37:11.963415Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1507.01934","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-18T01:37:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LqCg6EeL+qFDHrsfz9PuqidRjRmp5Nhw7midRgAOTjr411wWS/GtgYaVQlmPLnMmF6twJiQturnM4YfWergbCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T21:45:16.289395Z"},"content_sha256":"6ead421788d15165cad2dcf081ff99e260787bd459310b6861c30f3aa32ab680","schema_version":"1.0","event_id":"sha256:6ead421788d15165cad2dcf081ff99e260787bd459310b6861c30f3aa32ab680"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:AV6TZF4QKFR4UNYWZW3UC33VTG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the pathwidth of almost semicomplete digraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Hisao Tamaki, Kenta Kitsunai, Yasuaki Kobayashi","submitted_at":"2015-07-07T19:55:36Z","abstract_excerpt":"We call a digraph {\\em $h$-semicomplete} if each vertex of the digraph has at most $h$ non-neighbors, where a non-neighbor of a vertex $v$ is a vertex $u \\neq v$ such that there is no edge between $u$ and $v$ in either direction. This notion generalizes that of semicomplete digraphs which are $0$-semicomplete and tournaments which are semicomplete and have no anti-parallel pairs of edges. Our results in this paper are as follows. (1) We give an algorithm which, given an $h$-semicomplete digraph $G$ on $n$ vertices and a positive integer $k$, in $(h + 2k + 1)^{2k} n^{O(1)}$ time either construc"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.01934","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-18T01:37:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cEr+84JMML1auk2MyeaB7ioEKaZDxXmBA2HavPeXchjPb67PxpfAtFBAGABMkDyvIM5pIQ7zkDZl5JZB/P/TBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T21:45:16.289950Z"},"content_sha256":"77788e0ac9668fcaa137e99d3048970d37aca6d496a08c471b00c4cedc20e429","schema_version":"1.0","event_id":"sha256:77788e0ac9668fcaa137e99d3048970d37aca6d496a08c471b00c4cedc20e429"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AV6TZF4QKFR4UNYWZW3UC33VTG/bundle.json","state_url":"https://pith.science/pith/AV6TZF4QKFR4UNYWZW3UC33VTG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AV6TZF4QKFR4UNYWZW3UC33VTG/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-27T21:45:16Z","links":{"resolver":"https://pith.science/pith/AV6TZF4QKFR4UNYWZW3UC33VTG","bundle":"https://pith.science/pith/AV6TZF4QKFR4UNYWZW3UC33VTG/bundle.json","state":"https://pith.science/pith/AV6TZF4QKFR4UNYWZW3UC33VTG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AV6TZF4QKFR4UNYWZW3UC33VTG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:AV6TZF4QKFR4UNYWZW3UC33VTG","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":"7b8dd572b3e7c22eaeaec9e92172f4237d8a7850a66f86ce6a60583292a4a78b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-07-07T19:55:36Z","title_canon_sha256":"92efa9ebb78373794dd3d978fc64b3548907e1b7b810e627249e84acc20dda41"},"schema_version":"1.0","source":{"id":"1507.01934","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.01934","created_at":"2026-05-18T01:37:11Z"},{"alias_kind":"arxiv_version","alias_value":"1507.01934v1","created_at":"2026-05-18T01:37:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.01934","created_at":"2026-05-18T01:37:11Z"},{"alias_kind":"pith_short_12","alias_value":"AV6TZF4QKFR4","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_16","alias_value":"AV6TZF4QKFR4UNYW","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_8","alias_value":"AV6TZF4Q","created_at":"2026-05-18T12:29:10Z"}],"graph_snapshots":[{"event_id":"sha256:77788e0ac9668fcaa137e99d3048970d37aca6d496a08c471b00c4cedc20e429","target":"graph","created_at":"2026-05-18T01:37:11Z","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":"We call a digraph {\\em $h$-semicomplete} if each vertex of the digraph has at most $h$ non-neighbors, where a non-neighbor of a vertex $v$ is a vertex $u \\neq v$ such that there is no edge between $u$ and $v$ in either direction. This notion generalizes that of semicomplete digraphs which are $0$-semicomplete and tournaments which are semicomplete and have no anti-parallel pairs of edges. Our results in this paper are as follows. (1) We give an algorithm which, given an $h$-semicomplete digraph $G$ on $n$ vertices and a positive integer $k$, in $(h + 2k + 1)^{2k} n^{O(1)}$ time either construc","authors_text":"Hisao Tamaki, Kenta Kitsunai, Yasuaki Kobayashi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-07-07T19:55:36Z","title":"On the pathwidth of almost semicomplete digraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.01934","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:6ead421788d15165cad2dcf081ff99e260787bd459310b6861c30f3aa32ab680","target":"record","created_at":"2026-05-18T01:37:11Z","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":"7b8dd572b3e7c22eaeaec9e92172f4237d8a7850a66f86ce6a60583292a4a78b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-07-07T19:55:36Z","title_canon_sha256":"92efa9ebb78373794dd3d978fc64b3548907e1b7b810e627249e84acc20dda41"},"schema_version":"1.0","source":{"id":"1507.01934","kind":"arxiv","version":1}},"canonical_sha256":"057d3c97905163ca3716cdb7416f7599975dee08a46415899c8907f5c7b0dec0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"057d3c97905163ca3716cdb7416f7599975dee08a46415899c8907f5c7b0dec0","first_computed_at":"2026-05-18T01:37:11.963415Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:37:11.963415Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"CjrqXuRy7ENT7xRNEuDBT7UsLVLuYOU7mQVnL8nXoaF+zpnew/XpRn+6Y0WD/yPEKnb6IN41o9MoAi0Mp0TCBg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:37:11.964276Z","signed_message":"canonical_sha256_bytes"},"source_id":"1507.01934","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6ead421788d15165cad2dcf081ff99e260787bd459310b6861c30f3aa32ab680","sha256:77788e0ac9668fcaa137e99d3048970d37aca6d496a08c471b00c4cedc20e429"],"state_sha256":"710879b121845db73bca63de0ac95d05dfae5d651238d333d5b540762e5f3e99"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AKqFyzx++S75BGRQOBkjeE2VMLUeR5+C01T2/S4aovtEIIiF0e+6LZsAwXbrSRyOLgxeFYo00fn8EsTW1SKTAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T21:45:16.293459Z","bundle_sha256":"c2266975488e4b1cf347d9ec7ba4a832ca1b3655e3032a6ca0a4f03b0e07ad31"}}