{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:LQJKXS7KMH2OGBLLDSNXD6BZ5Q","short_pith_number":"pith:LQJKXS7K","schema_version":"1.0","canonical_sha256":"5c12abcbea61f4e3056b1c9b71f839ec36f89fd529e8b9bcfcaefcdac78d6018","source":{"kind":"arxiv","id":"1510.07124","version":1},"attestation_state":"computed","paper":{"title":"Space complexity of list H-coloring revisited: the case of oriented trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Laszlo Egri","submitted_at":"2015-10-24T09:54:46Z","abstract_excerpt":"Digraphs H for which the list homomorphism problem with template H (LHOM(H)) is in logspace (L) was characterized by Egri et al. (SODA 2014): LHOM(H) is in L if and only if H does not contain a circular N (assuming L is different from NL). Undirected graphs for which LHOM(H) is in L can be characterized in terms forbidden induced subgraphs, and also via a simple inductive construction (Egri et al., STACS 2010). As a consequence, the logspace algorithm in the undirected case is simple and easy to understand. No such forbidden subgraph or inductive characterization, and no such simple and easy-t"},"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":"1510.07124","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-10-24T09:54:46Z","cross_cats_sorted":[],"title_canon_sha256":"59101fff080fedf7ce7b243cb771a7598e338a9ec5064b02833924a213523990","abstract_canon_sha256":"ed6f630fc4e8fbb6bbaf32cc85b8d2c3fd0e7dfb9d40db7b22802568ac117531"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:29:20.003088Z","signature_b64":"RphE7SsUmSjLCuyJmnjcIpijZNGyBWXJf866NaKGgFyZ3zhhMukiBEb7vAJWdR5TTA13MLbNzlJ29JSscMtoAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5c12abcbea61f4e3056b1c9b71f839ec36f89fd529e8b9bcfcaefcdac78d6018","last_reissued_at":"2026-05-18T01:29:20.002496Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:29:20.002496Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Space complexity of list H-coloring revisited: the case of oriented trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Laszlo Egri","submitted_at":"2015-10-24T09:54:46Z","abstract_excerpt":"Digraphs H for which the list homomorphism problem with template H (LHOM(H)) is in logspace (L) was characterized by Egri et al. (SODA 2014): LHOM(H) is in L if and only if H does not contain a circular N (assuming L is different from NL). Undirected graphs for which LHOM(H) is in L can be characterized in terms forbidden induced subgraphs, and also via a simple inductive construction (Egri et al., STACS 2010). As a consequence, the logspace algorithm in the undirected case is simple and easy to understand. No such forbidden subgraph or inductive characterization, and no such simple and easy-t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.07124","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":"1510.07124","created_at":"2026-05-18T01:29:20.002608+00:00"},{"alias_kind":"arxiv_version","alias_value":"1510.07124v1","created_at":"2026-05-18T01:29:20.002608+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.07124","created_at":"2026-05-18T01:29:20.002608+00:00"},{"alias_kind":"pith_short_12","alias_value":"LQJKXS7KMH2O","created_at":"2026-05-18T12:29:29.992203+00:00"},{"alias_kind":"pith_short_16","alias_value":"LQJKXS7KMH2OGBLL","created_at":"2026-05-18T12:29:29.992203+00:00"},{"alias_kind":"pith_short_8","alias_value":"LQJKXS7K","created_at":"2026-05-18T12:29:29.992203+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/LQJKXS7KMH2OGBLLDSNXD6BZ5Q","json":"https://pith.science/pith/LQJKXS7KMH2OGBLLDSNXD6BZ5Q.json","graph_json":"https://pith.science/api/pith-number/LQJKXS7KMH2OGBLLDSNXD6BZ5Q/graph.json","events_json":"https://pith.science/api/pith-number/LQJKXS7KMH2OGBLLDSNXD6BZ5Q/events.json","paper":"https://pith.science/paper/LQJKXS7K"},"agent_actions":{"view_html":"https://pith.science/pith/LQJKXS7KMH2OGBLLDSNXD6BZ5Q","download_json":"https://pith.science/pith/LQJKXS7KMH2OGBLLDSNXD6BZ5Q.json","view_paper":"https://pith.science/paper/LQJKXS7K","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1510.07124&json=true","fetch_graph":"https://pith.science/api/pith-number/LQJKXS7KMH2OGBLLDSNXD6BZ5Q/graph.json","fetch_events":"https://pith.science/api/pith-number/LQJKXS7KMH2OGBLLDSNXD6BZ5Q/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LQJKXS7KMH2OGBLLDSNXD6BZ5Q/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LQJKXS7KMH2OGBLLDSNXD6BZ5Q/action/storage_attestation","attest_author":"https://pith.science/pith/LQJKXS7KMH2OGBLLDSNXD6BZ5Q/action/author_attestation","sign_citation":"https://pith.science/pith/LQJKXS7KMH2OGBLLDSNXD6BZ5Q/action/citation_signature","submit_replication":"https://pith.science/pith/LQJKXS7KMH2OGBLLDSNXD6BZ5Q/action/replication_record"}},"created_at":"2026-05-18T01:29:20.002608+00:00","updated_at":"2026-05-18T01:29:20.002608+00:00"}