{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:BTNWRKFYLGFJXIL44KUJXO4RK6","short_pith_number":"pith:BTNWRKFY","schema_version":"1.0","canonical_sha256":"0cdb68a8b8598a9ba17ce2a89bbb9157ba12caa3cc37a861aa16db16c5ae3f17","source":{"kind":"arxiv","id":"1602.05016","version":1},"attestation_state":"computed","paper":{"title":"Tight Lower Bounds on Graph Embedding Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Alexander Golovnev, Alexander S. Kulikov, Arkadiusz Soca{\\l}a, Fedor V. Fomin, Ivan Mihajlin, Jakub Pachocki, Marek Cygan","submitted_at":"2016-02-16T13:37:46Z","abstract_excerpt":"We prove that unless the Exponential Time Hypothesis (ETH) fails, deciding if there is a homomorphism from graph $G$ to graph $H$ cannot be done in time $|V(H)|^{o(|V(G)|)}$. We also show an exponential-time reduction from Graph Homomorphism to Subgraph Isomorphism. This rules out (subject to ETH) a possibility of $|V(H)|^{o(|V(H)|)}$-time algorithm deciding if graph $G$ is a subgraph of $H$. For both problems our lower bounds asymptotically match the running time of brute-force algorithms trying all possible mappings of one graph into another. Thus, our work closes the gap in the known comple"},"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":"1602.05016","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-02-16T13:37:46Z","cross_cats_sorted":[],"title_canon_sha256":"b8e1fb4a33bdf38b84972dd63cd188b6efc6377aecbffb68328c28c8ec864828","abstract_canon_sha256":"5072875dbcb5b8dc83afeecfb545103b0055d8205cc848d6a43317d218ec5682"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:20:37.684679Z","signature_b64":"k37g2PozcrKn75TufOlUzYjp//UQSnEW/qUwj/ux9f7iigkF8jv+cRIqFvbLm3McCiwJnEXItzVDNC1J6UHWCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0cdb68a8b8598a9ba17ce2a89bbb9157ba12caa3cc37a861aa16db16c5ae3f17","last_reissued_at":"2026-05-18T01:20:37.684283Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:20:37.684283Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Tight Lower Bounds on Graph Embedding Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Alexander Golovnev, Alexander S. Kulikov, Arkadiusz Soca{\\l}a, Fedor V. Fomin, Ivan Mihajlin, Jakub Pachocki, Marek Cygan","submitted_at":"2016-02-16T13:37:46Z","abstract_excerpt":"We prove that unless the Exponential Time Hypothesis (ETH) fails, deciding if there is a homomorphism from graph $G$ to graph $H$ cannot be done in time $|V(H)|^{o(|V(G)|)}$. We also show an exponential-time reduction from Graph Homomorphism to Subgraph Isomorphism. This rules out (subject to ETH) a possibility of $|V(H)|^{o(|V(H)|)}$-time algorithm deciding if graph $G$ is a subgraph of $H$. For both problems our lower bounds asymptotically match the running time of brute-force algorithms trying all possible mappings of one graph into another. Thus, our work closes the gap in the known comple"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.05016","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":"1602.05016","created_at":"2026-05-18T01:20:37.684348+00:00"},{"alias_kind":"arxiv_version","alias_value":"1602.05016v1","created_at":"2026-05-18T01:20:37.684348+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.05016","created_at":"2026-05-18T01:20:37.684348+00:00"},{"alias_kind":"pith_short_12","alias_value":"BTNWRKFYLGFJ","created_at":"2026-05-18T12:30:09.641336+00:00"},{"alias_kind":"pith_short_16","alias_value":"BTNWRKFYLGFJXIL4","created_at":"2026-05-18T12:30:09.641336+00:00"},{"alias_kind":"pith_short_8","alias_value":"BTNWRKFY","created_at":"2026-05-18T12:30:09.641336+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/BTNWRKFYLGFJXIL44KUJXO4RK6","json":"https://pith.science/pith/BTNWRKFYLGFJXIL44KUJXO4RK6.json","graph_json":"https://pith.science/api/pith-number/BTNWRKFYLGFJXIL44KUJXO4RK6/graph.json","events_json":"https://pith.science/api/pith-number/BTNWRKFYLGFJXIL44KUJXO4RK6/events.json","paper":"https://pith.science/paper/BTNWRKFY"},"agent_actions":{"view_html":"https://pith.science/pith/BTNWRKFYLGFJXIL44KUJXO4RK6","download_json":"https://pith.science/pith/BTNWRKFYLGFJXIL44KUJXO4RK6.json","view_paper":"https://pith.science/paper/BTNWRKFY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1602.05016&json=true","fetch_graph":"https://pith.science/api/pith-number/BTNWRKFYLGFJXIL44KUJXO4RK6/graph.json","fetch_events":"https://pith.science/api/pith-number/BTNWRKFYLGFJXIL44KUJXO4RK6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BTNWRKFYLGFJXIL44KUJXO4RK6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BTNWRKFYLGFJXIL44KUJXO4RK6/action/storage_attestation","attest_author":"https://pith.science/pith/BTNWRKFYLGFJXIL44KUJXO4RK6/action/author_attestation","sign_citation":"https://pith.science/pith/BTNWRKFYLGFJXIL44KUJXO4RK6/action/citation_signature","submit_replication":"https://pith.science/pith/BTNWRKFYLGFJXIL44KUJXO4RK6/action/replication_record"}},"created_at":"2026-05-18T01:20:37.684348+00:00","updated_at":"2026-05-18T01:20:37.684348+00:00"}