{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:PLFQAEA25NC7Y45A6E4RZSR3A7","short_pith_number":"pith:PLFQAEA2","canonical_record":{"source":{"id":"1502.05447","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-02-19T00:12:26Z","cross_cats_sorted":[],"title_canon_sha256":"71452054792501958b3d9a33f3c5f74530eb8468d6768ca70b297956a00bd5a6","abstract_canon_sha256":"24b81cd749940bd2d13cc06d3010d46507a987e8ba6bb9f9b9f58e732bcf8dc2"},"schema_version":"1.0"},"canonical_sha256":"7acb00101aeb45fc73a0f1391cca3b07fb5b8432a77b59799d42cb8bf6cb544d","source":{"kind":"arxiv","id":"1502.05447","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.05447","created_at":"2026-05-18T02:26:46Z"},{"alias_kind":"arxiv_version","alias_value":"1502.05447v1","created_at":"2026-05-18T02:26:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.05447","created_at":"2026-05-18T02:26:46Z"},{"alias_kind":"pith_short_12","alias_value":"PLFQAEA25NC7","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_16","alias_value":"PLFQAEA25NC7Y45A","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_8","alias_value":"PLFQAEA2","created_at":"2026-05-18T12:29:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:PLFQAEA25NC7Y45A6E4RZSR3A7","target":"record","payload":{"canonical_record":{"source":{"id":"1502.05447","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-02-19T00:12:26Z","cross_cats_sorted":[],"title_canon_sha256":"71452054792501958b3d9a33f3c5f74530eb8468d6768ca70b297956a00bd5a6","abstract_canon_sha256":"24b81cd749940bd2d13cc06d3010d46507a987e8ba6bb9f9b9f58e732bcf8dc2"},"schema_version":"1.0"},"canonical_sha256":"7acb00101aeb45fc73a0f1391cca3b07fb5b8432a77b59799d42cb8bf6cb544d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:26:46.516603Z","signature_b64":"mmjOnTlXuTu+rmiO8GZkxgkwFQjDFfuyoLQNWUObY0BMlh/p4sh2j9YduRLX7J5B2nBD1FDMjvzYzoPvzgiKDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7acb00101aeb45fc73a0f1391cca3b07fb5b8432a77b59799d42cb8bf6cb544d","last_reissued_at":"2026-05-18T02:26:46.516146Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:26:46.516146Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1502.05447","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-18T02:26:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZN6LDhX5Y8IDgv/XswaJT16qmH3gL3155ZE0973eiOosTEssl5pjK4C3T6oWHKn4ZW6x77y5+5fsFcSdKJJBBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T11:23:23.496894Z"},"content_sha256":"9d2e7f3044d4b93fcc7079e40529436f6940bac2e5936a8fb47bf6997794eaf4","schema_version":"1.0","event_id":"sha256:9d2e7f3044d4b93fcc7079e40529436f6940bac2e5936a8fb47bf6997794eaf4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:PLFQAEA25NC7Y45A6E4RZSR3A7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Lower Bounds for the Graph Homomorphism Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Alexander Golovnev, Alexander S. Kulikov, Fedor V. Fomin, Ivan Mihajlin","submitted_at":"2015-02-19T00:12:26Z","abstract_excerpt":"The graph homomorphism problem (HOM) asks whether the vertices of a given $n$-vertex graph $G$ can be mapped to the vertices of a given $h$-vertex graph $H$ such that each edge of $G$ is mapped to an edge of $H$. The problem generalizes the graph coloring problem and at the same time can be viewed as a special case of the $2$-CSP problem. In this paper, we prove several lower bound for HOM under the Exponential Time Hypothesis (ETH) assumption. The main result is a lower bound $2^{\\Omega\\left( \\frac{n \\log h}{\\log \\log h}\\right)}$. This rules out the existence of a single-exponential algorithm"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.05447","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-18T02:26:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gC08x3Xj240vZ/FeKVip4toTYkhI7JJh/Lkrl2rxflYKkmuE0lr2dyT1ll+/dHv9H/q30YtGZzUnQZIolGbYBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T11:23:23.497232Z"},"content_sha256":"5b8b7b2dd6a869414900c766aaeded6e04ba37cf40feb9a688a72e905442a0f3","schema_version":"1.0","event_id":"sha256:5b8b7b2dd6a869414900c766aaeded6e04ba37cf40feb9a688a72e905442a0f3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PLFQAEA25NC7Y45A6E4RZSR3A7/bundle.json","state_url":"https://pith.science/pith/PLFQAEA25NC7Y45A6E4RZSR3A7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PLFQAEA25NC7Y45A6E4RZSR3A7/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-08T11:23:23Z","links":{"resolver":"https://pith.science/pith/PLFQAEA25NC7Y45A6E4RZSR3A7","bundle":"https://pith.science/pith/PLFQAEA25NC7Y45A6E4RZSR3A7/bundle.json","state":"https://pith.science/pith/PLFQAEA25NC7Y45A6E4RZSR3A7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PLFQAEA25NC7Y45A6E4RZSR3A7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:PLFQAEA25NC7Y45A6E4RZSR3A7","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":"24b81cd749940bd2d13cc06d3010d46507a987e8ba6bb9f9b9f58e732bcf8dc2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-02-19T00:12:26Z","title_canon_sha256":"71452054792501958b3d9a33f3c5f74530eb8468d6768ca70b297956a00bd5a6"},"schema_version":"1.0","source":{"id":"1502.05447","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.05447","created_at":"2026-05-18T02:26:46Z"},{"alias_kind":"arxiv_version","alias_value":"1502.05447v1","created_at":"2026-05-18T02:26:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.05447","created_at":"2026-05-18T02:26:46Z"},{"alias_kind":"pith_short_12","alias_value":"PLFQAEA25NC7","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_16","alias_value":"PLFQAEA25NC7Y45A","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_8","alias_value":"PLFQAEA2","created_at":"2026-05-18T12:29:37Z"}],"graph_snapshots":[{"event_id":"sha256:5b8b7b2dd6a869414900c766aaeded6e04ba37cf40feb9a688a72e905442a0f3","target":"graph","created_at":"2026-05-18T02:26:46Z","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":"The graph homomorphism problem (HOM) asks whether the vertices of a given $n$-vertex graph $G$ can be mapped to the vertices of a given $h$-vertex graph $H$ such that each edge of $G$ is mapped to an edge of $H$. The problem generalizes the graph coloring problem and at the same time can be viewed as a special case of the $2$-CSP problem. In this paper, we prove several lower bound for HOM under the Exponential Time Hypothesis (ETH) assumption. The main result is a lower bound $2^{\\Omega\\left( \\frac{n \\log h}{\\log \\log h}\\right)}$. This rules out the existence of a single-exponential algorithm","authors_text":"Alexander Golovnev, Alexander S. Kulikov, Fedor V. Fomin, Ivan Mihajlin","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-02-19T00:12:26Z","title":"Lower Bounds for the Graph Homomorphism Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.05447","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:9d2e7f3044d4b93fcc7079e40529436f6940bac2e5936a8fb47bf6997794eaf4","target":"record","created_at":"2026-05-18T02:26:46Z","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":"24b81cd749940bd2d13cc06d3010d46507a987e8ba6bb9f9b9f58e732bcf8dc2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-02-19T00:12:26Z","title_canon_sha256":"71452054792501958b3d9a33f3c5f74530eb8468d6768ca70b297956a00bd5a6"},"schema_version":"1.0","source":{"id":"1502.05447","kind":"arxiv","version":1}},"canonical_sha256":"7acb00101aeb45fc73a0f1391cca3b07fb5b8432a77b59799d42cb8bf6cb544d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7acb00101aeb45fc73a0f1391cca3b07fb5b8432a77b59799d42cb8bf6cb544d","first_computed_at":"2026-05-18T02:26:46.516146Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:26:46.516146Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mmjOnTlXuTu+rmiO8GZkxgkwFQjDFfuyoLQNWUObY0BMlh/p4sh2j9YduRLX7J5B2nBD1FDMjvzYzoPvzgiKDA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:26:46.516603Z","signed_message":"canonical_sha256_bytes"},"source_id":"1502.05447","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9d2e7f3044d4b93fcc7079e40529436f6940bac2e5936a8fb47bf6997794eaf4","sha256:5b8b7b2dd6a869414900c766aaeded6e04ba37cf40feb9a688a72e905442a0f3"],"state_sha256":"787ea7fbb4fa0751a69d1f9d89b516cabff27560f9fcbabf797ea54f27dd29e8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"n+5bGt1fXjd5xT68XIr7liGhxRxKDgLhCIktoZXtZZUjl74fm9LZ4NEKyXuAKCNYOt6np0P1hWHB3QrQPFLKAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T11:23:23.499033Z","bundle_sha256":"1e9fcaac003c583a256359189413636d28a61f90a71f58bb27bcfe370f98f124"}}