{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:IAB36DJKWSQ6WIJUK6SFBH4IWW","short_pith_number":"pith:IAB36DJK","schema_version":"1.0","canonical_sha256":"4003bf0d2ab4a1eb213457a4509f88b5a9ec25e0841e09b8081e801710870d41","source":{"kind":"arxiv","id":"1403.2009","version":1},"attestation_state":"computed","paper":{"title":"On the Ordered List Subgraph Embedding Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","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","submitted_at":"2014-03-08T22:10:25Z","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"},"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":"1403.2009","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-03-08T22:10:25Z","cross_cats_sorted":[],"title_canon_sha256":"e4130d2ed4634084135d56258e13bfe75ad0336521865b8507f7a48b427ce49c","abstract_canon_sha256":"f9e7d417bb0b6e14ce2f007e889cdd93c4d9798d460884f16caa4e177a9391b5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:56:51.055072Z","signature_b64":"ylJnByFlMQ55mUyXCvQuGnOjhQzwMtr9zBxPFUsHORJQIigZp+mSNIwCvF2wq7ZIOrf/iIMapnVBQ29+vJM2Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4003bf0d2ab4a1eb213457a4509f88b5a9ec25e0841e09b8081e801710870d41","last_reissued_at":"2026-05-18T02:56:51.054696Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:56:51.054696Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Ordered List Subgraph Embedding Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","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","submitted_at":"2014-03-08T22:10:25Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.2009","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":"1403.2009","created_at":"2026-05-18T02:56:51.054753+00:00"},{"alias_kind":"arxiv_version","alias_value":"1403.2009v1","created_at":"2026-05-18T02:56:51.054753+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.2009","created_at":"2026-05-18T02:56:51.054753+00:00"},{"alias_kind":"pith_short_12","alias_value":"IAB36DJKWSQ6","created_at":"2026-05-18T12:28:33.132498+00:00"},{"alias_kind":"pith_short_16","alias_value":"IAB36DJKWSQ6WIJU","created_at":"2026-05-18T12:28:33.132498+00:00"},{"alias_kind":"pith_short_8","alias_value":"IAB36DJK","created_at":"2026-05-18T12:28:33.132498+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/IAB36DJKWSQ6WIJUK6SFBH4IWW","json":"https://pith.science/pith/IAB36DJKWSQ6WIJUK6SFBH4IWW.json","graph_json":"https://pith.science/api/pith-number/IAB36DJKWSQ6WIJUK6SFBH4IWW/graph.json","events_json":"https://pith.science/api/pith-number/IAB36DJKWSQ6WIJUK6SFBH4IWW/events.json","paper":"https://pith.science/paper/IAB36DJK"},"agent_actions":{"view_html":"https://pith.science/pith/IAB36DJKWSQ6WIJUK6SFBH4IWW","download_json":"https://pith.science/pith/IAB36DJKWSQ6WIJUK6SFBH4IWW.json","view_paper":"https://pith.science/paper/IAB36DJK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1403.2009&json=true","fetch_graph":"https://pith.science/api/pith-number/IAB36DJKWSQ6WIJUK6SFBH4IWW/graph.json","fetch_events":"https://pith.science/api/pith-number/IAB36DJKWSQ6WIJUK6SFBH4IWW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IAB36DJKWSQ6WIJUK6SFBH4IWW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IAB36DJKWSQ6WIJUK6SFBH4IWW/action/storage_attestation","attest_author":"https://pith.science/pith/IAB36DJKWSQ6WIJUK6SFBH4IWW/action/author_attestation","sign_citation":"https://pith.science/pith/IAB36DJKWSQ6WIJUK6SFBH4IWW/action/citation_signature","submit_replication":"https://pith.science/pith/IAB36DJKWSQ6WIJUK6SFBH4IWW/action/replication_record"}},"created_at":"2026-05-18T02:56:51.054753+00:00","updated_at":"2026-05-18T02:56:51.054753+00:00"}