{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:KW465ZRWAHQJ2YKVZCIRQKAQSF","short_pith_number":"pith:KW465ZRW","canonical_record":{"source":{"id":"1506.09145","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-06-30T16:20:54Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"4d4f78676fbec4eeb677a85cb7bc67dbbf7435b804810e4533d7680b162e1af2","abstract_canon_sha256":"7612a3012d91af2282507ba326349e8c133c7fa34aa692c2822dcc7459c8986a"},"schema_version":"1.0"},"canonical_sha256":"55b9eee63601e09d6155c891182810914aa669b46a8903c8748e96c2179460ed","source":{"kind":"arxiv","id":"1506.09145","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.09145","created_at":"2026-05-17T23:49:06Z"},{"alias_kind":"arxiv_version","alias_value":"1506.09145v2","created_at":"2026-05-17T23:49:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.09145","created_at":"2026-05-17T23:49:06Z"},{"alias_kind":"pith_short_12","alias_value":"KW465ZRWAHQJ","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_16","alias_value":"KW465ZRWAHQJ2YKV","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_8","alias_value":"KW465ZRW","created_at":"2026-05-18T12:29:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:KW465ZRWAHQJ2YKVZCIRQKAQSF","target":"record","payload":{"canonical_record":{"source":{"id":"1506.09145","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-06-30T16:20:54Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"4d4f78676fbec4eeb677a85cb7bc67dbbf7435b804810e4533d7680b162e1af2","abstract_canon_sha256":"7612a3012d91af2282507ba326349e8c133c7fa34aa692c2822dcc7459c8986a"},"schema_version":"1.0"},"canonical_sha256":"55b9eee63601e09d6155c891182810914aa669b46a8903c8748e96c2179460ed","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:49:06.613714Z","signature_b64":"WGPLAknL1+VDSdjYgmqEVj7aWSXBzkS4fjqD55elPb4Yqf/gzoZKhk8j9rG3Q9czfjOKTFS3G2H7Esymw2uoAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"55b9eee63601e09d6155c891182810914aa669b46a8903c8748e96c2179460ed","last_reissued_at":"2026-05-17T23:49:06.613033Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:49:06.613033Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1506.09145","source_version":2,"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-17T23:49:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OoBdfnp7eQ/YxqA2bzKGT9P54Qk3gDrQWzeKQobbv8eKs36A5CyyRnP2l+JeKNw74nItEgckm6B//SlENtn2CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T00:09:38.313251Z"},"content_sha256":"893253967abe154f9edfd18a51c78e9c8f30908ff879de2c6a710408d46a5428","schema_version":"1.0","event_id":"sha256:893253967abe154f9edfd18a51c78e9c8f30908ff879de2c6a710408d46a5428"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:KW465ZRWAHQJ2YKVZCIRQKAQSF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Track Layouts, Layered Path Decompositions, and Leveled Planarity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"math.CO","authors_text":"David Eppstein, David R. Wood, Michael J. Bannister, Vida Dujmovi\\'c, William E. Devanny","submitted_at":"2015-06-30T16:20:54Z","abstract_excerpt":"We investigate two types of graph layouts, track layouts and layered path decompositions, and the relations between their associated parameters track-number and layered pathwidth. We use these two types of layouts to characterize leveled planar graphs, which are the graphs with planar leveled drawings with no dummy vertices. It follows from the known NP-completeness of leveled planarity that track-number and layered pathwidth are also NP-complete, even for the smallest constant parameter values that make these parameters nontrivial. We prove that the graphs with bounded layered pathwidth inclu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.09145","kind":"arxiv","version":2},"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-17T23:49:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"E9UprqPXZ0HObXoD4/ZwSdN9wetwbEPhk832M5jNCTV6vHjuyOsILMrysW7U2DxTbq5iGnvn6pWhFPrE3U53Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T00:09:38.313940Z"},"content_sha256":"5a3a354b549b8b16b7553ca0312aaa4ee3134d5a0377b7f5853794238e1060c4","schema_version":"1.0","event_id":"sha256:5a3a354b549b8b16b7553ca0312aaa4ee3134d5a0377b7f5853794238e1060c4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KW465ZRWAHQJ2YKVZCIRQKAQSF/bundle.json","state_url":"https://pith.science/pith/KW465ZRWAHQJ2YKVZCIRQKAQSF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KW465ZRWAHQJ2YKVZCIRQKAQSF/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-26T00:09:38Z","links":{"resolver":"https://pith.science/pith/KW465ZRWAHQJ2YKVZCIRQKAQSF","bundle":"https://pith.science/pith/KW465ZRWAHQJ2YKVZCIRQKAQSF/bundle.json","state":"https://pith.science/pith/KW465ZRWAHQJ2YKVZCIRQKAQSF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KW465ZRWAHQJ2YKVZCIRQKAQSF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:KW465ZRWAHQJ2YKVZCIRQKAQSF","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":"7612a3012d91af2282507ba326349e8c133c7fa34aa692c2822dcc7459c8986a","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-06-30T16:20:54Z","title_canon_sha256":"4d4f78676fbec4eeb677a85cb7bc67dbbf7435b804810e4533d7680b162e1af2"},"schema_version":"1.0","source":{"id":"1506.09145","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.09145","created_at":"2026-05-17T23:49:06Z"},{"alias_kind":"arxiv_version","alias_value":"1506.09145v2","created_at":"2026-05-17T23:49:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.09145","created_at":"2026-05-17T23:49:06Z"},{"alias_kind":"pith_short_12","alias_value":"KW465ZRWAHQJ","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_16","alias_value":"KW465ZRWAHQJ2YKV","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_8","alias_value":"KW465ZRW","created_at":"2026-05-18T12:29:29Z"}],"graph_snapshots":[{"event_id":"sha256:5a3a354b549b8b16b7553ca0312aaa4ee3134d5a0377b7f5853794238e1060c4","target":"graph","created_at":"2026-05-17T23:49:06Z","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 investigate two types of graph layouts, track layouts and layered path decompositions, and the relations between their associated parameters track-number and layered pathwidth. We use these two types of layouts to characterize leveled planar graphs, which are the graphs with planar leveled drawings with no dummy vertices. It follows from the known NP-completeness of leveled planarity that track-number and layered pathwidth are also NP-complete, even for the smallest constant parameter values that make these parameters nontrivial. We prove that the graphs with bounded layered pathwidth inclu","authors_text":"David Eppstein, David R. Wood, Michael J. Bannister, Vida Dujmovi\\'c, William E. Devanny","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-06-30T16:20:54Z","title":"Track Layouts, Layered Path Decompositions, and Leveled Planarity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.09145","kind":"arxiv","version":2},"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:893253967abe154f9edfd18a51c78e9c8f30908ff879de2c6a710408d46a5428","target":"record","created_at":"2026-05-17T23:49:06Z","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":"7612a3012d91af2282507ba326349e8c133c7fa34aa692c2822dcc7459c8986a","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-06-30T16:20:54Z","title_canon_sha256":"4d4f78676fbec4eeb677a85cb7bc67dbbf7435b804810e4533d7680b162e1af2"},"schema_version":"1.0","source":{"id":"1506.09145","kind":"arxiv","version":2}},"canonical_sha256":"55b9eee63601e09d6155c891182810914aa669b46a8903c8748e96c2179460ed","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"55b9eee63601e09d6155c891182810914aa669b46a8903c8748e96c2179460ed","first_computed_at":"2026-05-17T23:49:06.613033Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:49:06.613033Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"WGPLAknL1+VDSdjYgmqEVj7aWSXBzkS4fjqD55elPb4Yqf/gzoZKhk8j9rG3Q9czfjOKTFS3G2H7Esymw2uoAg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:49:06.613714Z","signed_message":"canonical_sha256_bytes"},"source_id":"1506.09145","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:893253967abe154f9edfd18a51c78e9c8f30908ff879de2c6a710408d46a5428","sha256:5a3a354b549b8b16b7553ca0312aaa4ee3134d5a0377b7f5853794238e1060c4"],"state_sha256":"ac755ac270ccbb6a52351955f9ea7dca2663fc98c34a25055c7a0b5aa8626568"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DZ0vQM3vdBN0lLphwweS73kmlfMRQgTohE9AhxlhedwdN85bBsbiBv5A33NsTdnWfpkabDC5FUIdDyc8fITXBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T00:09:38.317259Z","bundle_sha256":"5722b59e5bfb10ef3d4d6fb571cf6ef5c07e02c92814f3e09318e653f2a73c34"}}