{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:PMO623DKQR2SISIHNJNVSELUAR","short_pith_number":"pith:PMO623DK","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"},"canonical_sha256":"7b1ded6c6a84752449076a5b5911740470ca160fad1196029532e253878d512e","source":{"kind":"arxiv","id":"1610.09130","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.09130","created_at":"2026-05-18T01:00:59Z"},{"alias_kind":"arxiv_version","alias_value":"1610.09130v1","created_at":"2026-05-18T01:00:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.09130","created_at":"2026-05-18T01:00:59Z"},{"alias_kind":"pith_short_12","alias_value":"PMO623DKQR2S","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_16","alias_value":"PMO623DKQR2SISIH","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_8","alias_value":"PMO623DK","created_at":"2026-05-18T12:30:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:PMO623DKQR2SISIHNJNVSELUAR","target":"record","payload":{"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"},"canonical_sha256":"7b1ded6c6a84752449076a5b5911740470ca160fad1196029532e253878d512e","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"},"source_kind":"arxiv","source_id":"1610.09130","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:00:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"usSxyfJ8WaUFmNW1hJoXw7IcQBMdcODFHJx3yMRJA2GV3/1+sITie0cc9YzS5d1YyL30s/aRUnXCpboco4muAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T09:09:21.387577Z"},"content_sha256":"dbd5884ea3704ffdf3b67dee23e359f0e6a2009859d15bc80a033fedcb9657c9","schema_version":"1.0","event_id":"sha256:dbd5884ea3704ffdf3b67dee23e359f0e6a2009859d15bc80a033fedcb9657c9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:PMO623DKQR2SISIHNJNVSELUAR","target":"graph","payload":{"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"},"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:00:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uuk5vHrhJSYlj2KDsz4uH+US4uqJwnFElfI+TIb14Cjq2qF+UVzKFEVI3PBbXHhLD79AQCZbQjJwy3HPchn/AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T09:09:21.388211Z"},"content_sha256":"e364ca63ab4e5b8800aedfeb64c72360043d120e5b557835b85439ec494661a0","schema_version":"1.0","event_id":"sha256:e364ca63ab4e5b8800aedfeb64c72360043d120e5b557835b85439ec494661a0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PMO623DKQR2SISIHNJNVSELUAR/bundle.json","state_url":"https://pith.science/pith/PMO623DKQR2SISIHNJNVSELUAR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PMO623DKQR2SISIHNJNVSELUAR/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-05-28T09:09:21Z","links":{"resolver":"https://pith.science/pith/PMO623DKQR2SISIHNJNVSELUAR","bundle":"https://pith.science/pith/PMO623DKQR2SISIHNJNVSELUAR/bundle.json","state":"https://pith.science/pith/PMO623DKQR2SISIHNJNVSELUAR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PMO623DKQR2SISIHNJNVSELUAR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:PMO623DKQR2SISIHNJNVSELUAR","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":"25137e3361921a10604ebcfe4ed851337e2609209f95904d780f4445947d0666","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-10-28T09:13:30Z","title_canon_sha256":"f559a4cb902e8db9f51da42b96cbcf0ddd14dd34ee28efac0b255a941db8c01f"},"schema_version":"1.0","source":{"id":"1610.09130","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.09130","created_at":"2026-05-18T01:00:59Z"},{"alias_kind":"arxiv_version","alias_value":"1610.09130v1","created_at":"2026-05-18T01:00:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.09130","created_at":"2026-05-18T01:00:59Z"},{"alias_kind":"pith_short_12","alias_value":"PMO623DKQR2S","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_16","alias_value":"PMO623DKQR2SISIH","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_8","alias_value":"PMO623DK","created_at":"2026-05-18T12:30:39Z"}],"graph_snapshots":[{"event_id":"sha256:e364ca63ab4e5b8800aedfeb64c72360043d120e5b557835b85439ec494661a0","target":"graph","created_at":"2026-05-18T01:00:59Z","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":"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","authors_text":"Hans L. Bodlaender, Tom C. van der Zanden","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-10-28T09:13:30Z","title":"Improved Lower Bounds for Graph Embedding Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.09130","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:dbd5884ea3704ffdf3b67dee23e359f0e6a2009859d15bc80a033fedcb9657c9","target":"record","created_at":"2026-05-18T01:00:59Z","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":"25137e3361921a10604ebcfe4ed851337e2609209f95904d780f4445947d0666","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-10-28T09:13:30Z","title_canon_sha256":"f559a4cb902e8db9f51da42b96cbcf0ddd14dd34ee28efac0b255a941db8c01f"},"schema_version":"1.0","source":{"id":"1610.09130","kind":"arxiv","version":1}},"canonical_sha256":"7b1ded6c6a84752449076a5b5911740470ca160fad1196029532e253878d512e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7b1ded6c6a84752449076a5b5911740470ca160fad1196029532e253878d512e","first_computed_at":"2026-05-18T01:00:59.061547Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:00:59.061547Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"lgBTE7l5+Ls+N78XYlxVvd4mwdLOIY0DkUbG780gXMTJjtdP8NKLyKK1JOf5eu/mZX2mnaXKYPEHzY4J4lS2Dw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:00:59.062213Z","signed_message":"canonical_sha256_bytes"},"source_id":"1610.09130","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:dbd5884ea3704ffdf3b67dee23e359f0e6a2009859d15bc80a033fedcb9657c9","sha256:e364ca63ab4e5b8800aedfeb64c72360043d120e5b557835b85439ec494661a0"],"state_sha256":"0595bc52052e23438b8db10fbe26171aabf4a4e62afdc5a714924b1c62fa6a70"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dnrFtOsdHJoxhV28e0me/nCb1ToNajGrUte4JKUh9rRfPHQndKd8i3960SO7QHAz+6fy9qh2/aXhk/6oyIFfCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T09:09:21.391350Z","bundle_sha256":"71841dd1b9195acac65f58c36f978973db39f15248c0ddcef874921c3e200e2f"}}