{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:LQJKXS7KMH2OGBLLDSNXD6BZ5Q","short_pith_number":"pith:LQJKXS7K","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"},"canonical_sha256":"5c12abcbea61f4e3056b1c9b71f839ec36f89fd529e8b9bcfcaefcdac78d6018","source":{"kind":"arxiv","id":"1510.07124","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.07124","created_at":"2026-05-18T01:29:20Z"},{"alias_kind":"arxiv_version","alias_value":"1510.07124v1","created_at":"2026-05-18T01:29:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.07124","created_at":"2026-05-18T01:29:20Z"},{"alias_kind":"pith_short_12","alias_value":"LQJKXS7KMH2O","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_16","alias_value":"LQJKXS7KMH2OGBLL","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_8","alias_value":"LQJKXS7K","created_at":"2026-05-18T12:29:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:LQJKXS7KMH2OGBLLDSNXD6BZ5Q","target":"record","payload":{"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"},"canonical_sha256":"5c12abcbea61f4e3056b1c9b71f839ec36f89fd529e8b9bcfcaefcdac78d6018","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"},"source_kind":"arxiv","source_id":"1510.07124","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:29:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5FK545bLq4qS4C6GSeca0OMma8PgBgmmHr3T4a53xzgWwwlJrXNX9qAa3GIqiL5vhorHviRT7WcsaHA+iACIDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T09:45:59.299481Z"},"content_sha256":"8f6e838230e51e4e049332a5c482e3d4743e03e2d32fbe7b41e12bc3d27b77a6","schema_version":"1.0","event_id":"sha256:8f6e838230e51e4e049332a5c482e3d4743e03e2d32fbe7b41e12bc3d27b77a6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:LQJKXS7KMH2OGBLLDSNXD6BZ5Q","target":"graph","payload":{"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"},"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:29:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2k2gBsxGtoEv8H4bHRUHOfa4W/WlSKK7q30hei7dHz6C8l14zxIvJsClT4OwWM44LIJKLeZMTVRvo8vwbk9KAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T09:45:59.299822Z"},"content_sha256":"926107fa769c21bb675ec4dc873fe54823128f7a0dbdb3ab9c2430931a430aa7","schema_version":"1.0","event_id":"sha256:926107fa769c21bb675ec4dc873fe54823128f7a0dbdb3ab9c2430931a430aa7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LQJKXS7KMH2OGBLLDSNXD6BZ5Q/bundle.json","state_url":"https://pith.science/pith/LQJKXS7KMH2OGBLLDSNXD6BZ5Q/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LQJKXS7KMH2OGBLLDSNXD6BZ5Q/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-06-23T09:45:59Z","links":{"resolver":"https://pith.science/pith/LQJKXS7KMH2OGBLLDSNXD6BZ5Q","bundle":"https://pith.science/pith/LQJKXS7KMH2OGBLLDSNXD6BZ5Q/bundle.json","state":"https://pith.science/pith/LQJKXS7KMH2OGBLLDSNXD6BZ5Q/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LQJKXS7KMH2OGBLLDSNXD6BZ5Q/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:LQJKXS7KMH2OGBLLDSNXD6BZ5Q","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":"ed6f630fc4e8fbb6bbaf32cc85b8d2c3fd0e7dfb9d40db7b22802568ac117531","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-10-24T09:54:46Z","title_canon_sha256":"59101fff080fedf7ce7b243cb771a7598e338a9ec5064b02833924a213523990"},"schema_version":"1.0","source":{"id":"1510.07124","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.07124","created_at":"2026-05-18T01:29:20Z"},{"alias_kind":"arxiv_version","alias_value":"1510.07124v1","created_at":"2026-05-18T01:29:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.07124","created_at":"2026-05-18T01:29:20Z"},{"alias_kind":"pith_short_12","alias_value":"LQJKXS7KMH2O","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_16","alias_value":"LQJKXS7KMH2OGBLL","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_8","alias_value":"LQJKXS7K","created_at":"2026-05-18T12:29:29Z"}],"graph_snapshots":[{"event_id":"sha256:926107fa769c21bb675ec4dc873fe54823128f7a0dbdb3ab9c2430931a430aa7","target":"graph","created_at":"2026-05-18T01:29:20Z","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":"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","authors_text":"Laszlo Egri","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-10-24T09:54:46Z","title":"Space complexity of list H-coloring revisited: the case of oriented trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.07124","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:8f6e838230e51e4e049332a5c482e3d4743e03e2d32fbe7b41e12bc3d27b77a6","target":"record","created_at":"2026-05-18T01:29:20Z","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":"ed6f630fc4e8fbb6bbaf32cc85b8d2c3fd0e7dfb9d40db7b22802568ac117531","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-10-24T09:54:46Z","title_canon_sha256":"59101fff080fedf7ce7b243cb771a7598e338a9ec5064b02833924a213523990"},"schema_version":"1.0","source":{"id":"1510.07124","kind":"arxiv","version":1}},"canonical_sha256":"5c12abcbea61f4e3056b1c9b71f839ec36f89fd529e8b9bcfcaefcdac78d6018","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5c12abcbea61f4e3056b1c9b71f839ec36f89fd529e8b9bcfcaefcdac78d6018","first_computed_at":"2026-05-18T01:29:20.002496Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:29:20.002496Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"RphE7SsUmSjLCuyJmnjcIpijZNGyBWXJf866NaKGgFyZ3zhhMukiBEb7vAJWdR5TTA13MLbNzlJ29JSscMtoAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:29:20.003088Z","signed_message":"canonical_sha256_bytes"},"source_id":"1510.07124","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8f6e838230e51e4e049332a5c482e3d4743e03e2d32fbe7b41e12bc3d27b77a6","sha256:926107fa769c21bb675ec4dc873fe54823128f7a0dbdb3ab9c2430931a430aa7"],"state_sha256":"578b3ef072f33180ccee556d60c7ca0beebbf062b2af01240c2d392fe89453d4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"E5E16uIbVLSKkQoe8zcUo4kafbOyjYsMkRTVdHMGZktGF+tGDEIskGceJtm/lOKoazeTE8hGSe0s0p9PA0NBCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T09:45:59.301636Z","bundle_sha256":"38890bafa07ab64fa76a04c819093da71a536f8f62db791f75d8b4a45583d8d8"}}