{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:PMO623DKQR2SISIHNJNVSELUAR","short_pith_number":"pith:PMO623DK","schema_version":"1.0","canonical_sha256":"7b1ded6c6a84752449076a5b5911740470ca160fad1196029532e253878d512e","source":{"kind":"arxiv","id":"1610.09130","version":1},"attestation_state":"computed","paper":{"title":"Improved Lower Bounds for Graph Embedding Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.CC","authors_text":"Hans L. Bodlaender, Tom C. van der Zanden","submitted_at":"2016-10-28T09:13:30Z","abstract_excerpt":"In this paper, we give new, tight subexponential lower bounds for a number of graph embedding problems. We introduce two related combinatorial problems, which we call String Crafting and Orthogonal Vector crafting, and show that these cannot be solved in time $2^{o(|s|/\\log{|s|})}$, unless the Exponential Time Hypothesis fails.\n  These results are used to obtain simplified hardness results for several graph embedding problems, on more restricted graph classes than previously known: assuming the Exponential Time Hypothesis, there do not exist algorithms that run in $2^{o(n/\\log n)}$ time for Su"},"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":"1610.09130","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-10-28T09:13:30Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"f559a4cb902e8db9f51da42b96cbcf0ddd14dd34ee28efac0b255a941db8c01f","abstract_canon_sha256":"25137e3361921a10604ebcfe4ed851337e2609209f95904d780f4445947d0666"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:00:59.062213Z","signature_b64":"lgBTE7l5+Ls+N78XYlxVvd4mwdLOIY0DkUbG780gXMTJjtdP8NKLyKK1JOf5eu/mZX2mnaXKYPEHzY4J4lS2Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7b1ded6c6a84752449076a5b5911740470ca160fad1196029532e253878d512e","last_reissued_at":"2026-05-18T01:00:59.061547Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:00:59.061547Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Improved Lower Bounds for Graph Embedding Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.CC","authors_text":"Hans L. Bodlaender, Tom C. van der Zanden","submitted_at":"2016-10-28T09:13:30Z","abstract_excerpt":"In this paper, we give new, tight subexponential lower bounds for a number of graph embedding problems. We introduce two related combinatorial problems, which we call String Crafting and Orthogonal Vector crafting, and show that these cannot be solved in time $2^{o(|s|/\\log{|s|})}$, unless the Exponential Time Hypothesis fails.\n  These results are used to obtain simplified hardness results for several graph embedding problems, on more restricted graph classes than previously known: assuming the Exponential Time Hypothesis, there do not exist algorithms that run in $2^{o(n/\\log n)}$ time for Su"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.09130","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":"1610.09130","created_at":"2026-05-18T01:00:59.061650+00:00"},{"alias_kind":"arxiv_version","alias_value":"1610.09130v1","created_at":"2026-05-18T01:00:59.061650+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.09130","created_at":"2026-05-18T01:00:59.061650+00:00"},{"alias_kind":"pith_short_12","alias_value":"PMO623DKQR2S","created_at":"2026-05-18T12:30:39.010887+00:00"},{"alias_kind":"pith_short_16","alias_value":"PMO623DKQR2SISIH","created_at":"2026-05-18T12:30:39.010887+00:00"},{"alias_kind":"pith_short_8","alias_value":"PMO623DK","created_at":"2026-05-18T12:30:39.010887+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/PMO623DKQR2SISIHNJNVSELUAR","json":"https://pith.science/pith/PMO623DKQR2SISIHNJNVSELUAR.json","graph_json":"https://pith.science/api/pith-number/PMO623DKQR2SISIHNJNVSELUAR/graph.json","events_json":"https://pith.science/api/pith-number/PMO623DKQR2SISIHNJNVSELUAR/events.json","paper":"https://pith.science/paper/PMO623DK"},"agent_actions":{"view_html":"https://pith.science/pith/PMO623DKQR2SISIHNJNVSELUAR","download_json":"https://pith.science/pith/PMO623DKQR2SISIHNJNVSELUAR.json","view_paper":"https://pith.science/paper/PMO623DK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1610.09130&json=true","fetch_graph":"https://pith.science/api/pith-number/PMO623DKQR2SISIHNJNVSELUAR/graph.json","fetch_events":"https://pith.science/api/pith-number/PMO623DKQR2SISIHNJNVSELUAR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PMO623DKQR2SISIHNJNVSELUAR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PMO623DKQR2SISIHNJNVSELUAR/action/storage_attestation","attest_author":"https://pith.science/pith/PMO623DKQR2SISIHNJNVSELUAR/action/author_attestation","sign_citation":"https://pith.science/pith/PMO623DKQR2SISIHNJNVSELUAR/action/citation_signature","submit_replication":"https://pith.science/pith/PMO623DKQR2SISIHNJNVSELUAR/action/replication_record"}},"created_at":"2026-05-18T01:00:59.061650+00:00","updated_at":"2026-05-18T01:00:59.061650+00:00"}