{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:IAB36DJKWSQ6WIJUK6SFBH4IWW","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":"f9e7d417bb0b6e14ce2f007e889cdd93c4d9798d460884f16caa4e177a9391b5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-03-08T22:10:25Z","title_canon_sha256":"e4130d2ed4634084135d56258e13bfe75ad0336521865b8507f7a48b427ce49c"},"schema_version":"1.0","source":{"id":"1403.2009","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1403.2009","created_at":"2026-05-18T02:56:51Z"},{"alias_kind":"arxiv_version","alias_value":"1403.2009v1","created_at":"2026-05-18T02:56:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.2009","created_at":"2026-05-18T02:56:51Z"},{"alias_kind":"pith_short_12","alias_value":"IAB36DJKWSQ6","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_16","alias_value":"IAB36DJKWSQ6WIJU","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_8","alias_value":"IAB36DJK","created_at":"2026-05-18T12:28:33Z"}],"graph_snapshots":[{"event_id":"sha256:a5b4fcc71f18d93430757bca02057ec5abd484b2d212630572a1f3adfb1e1df9","target":"graph","created_at":"2026-05-18T02:56:51Z","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":"In the (parameterized) Ordered List Subgraph Embedding problem (p-OLSE) we are given two graphs $G$ and $H$, each with a linear order defined on its vertices, a function $L$ that associates with every vertex in $G$ a list of vertices in $H$, and a parameter $k$. The question is to decide if we can embed (one-to-one) a subgraph $S$ of $G$ of $k$ vertices into $H$ such that: (1) every vertex of $S$ is mapped to a vertex from its associated list, (2) the linear orders inherited by $S$ and its image under the embedding are respected, and (3) if there is an edge between two vertices in $S$ then the","authors_text":"(2) Department of Informatics, Bergen, Daniel Lokshtanov (2), DePaul University, Iyad Kanj (1), Ljubomir Perkovi\\'c (1) ((1) School of Computing, Norway), Olawale Hassan (1), University of Bergen","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-03-08T22:10:25Z","title":"On the Ordered List Subgraph Embedding Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.2009","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:02e6eaf966c78156cd2e84ea2528866072554a839734fcf4f4bc3abf34f80319","target":"record","created_at":"2026-05-18T02:56:51Z","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":"f9e7d417bb0b6e14ce2f007e889cdd93c4d9798d460884f16caa4e177a9391b5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-03-08T22:10:25Z","title_canon_sha256":"e4130d2ed4634084135d56258e13bfe75ad0336521865b8507f7a48b427ce49c"},"schema_version":"1.0","source":{"id":"1403.2009","kind":"arxiv","version":1}},"canonical_sha256":"4003bf0d2ab4a1eb213457a4509f88b5a9ec25e0841e09b8081e801710870d41","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4003bf0d2ab4a1eb213457a4509f88b5a9ec25e0841e09b8081e801710870d41","first_computed_at":"2026-05-18T02:56:51.054696Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:56:51.054696Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ylJnByFlMQ55mUyXCvQuGnOjhQzwMtr9zBxPFUsHORJQIigZp+mSNIwCvF2wq7ZIOrf/iIMapnVBQ29+vJM2Ag==","signature_status":"signed_v1","signed_at":"2026-05-18T02:56:51.055072Z","signed_message":"canonical_sha256_bytes"},"source_id":"1403.2009","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:02e6eaf966c78156cd2e84ea2528866072554a839734fcf4f4bc3abf34f80319","sha256:a5b4fcc71f18d93430757bca02057ec5abd484b2d212630572a1f3adfb1e1df9"],"state_sha256":"4eaf08c2250e91a956730a9aed81f942b07400fe7bdacece8fdb7c640667b1ea"}