{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:BTNWRKFYLGFJXIL44KUJXO4RK6","short_pith_number":"pith:BTNWRKFY","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"},"canonical_sha256":"0cdb68a8b8598a9ba17ce2a89bbb9157ba12caa3cc37a861aa16db16c5ae3f17","source":{"kind":"arxiv","id":"1602.05016","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.05016","created_at":"2026-05-18T01:20:37Z"},{"alias_kind":"arxiv_version","alias_value":"1602.05016v1","created_at":"2026-05-18T01:20:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.05016","created_at":"2026-05-18T01:20:37Z"},{"alias_kind":"pith_short_12","alias_value":"BTNWRKFYLGFJ","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_16","alias_value":"BTNWRKFYLGFJXIL4","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_8","alias_value":"BTNWRKFY","created_at":"2026-05-18T12:30:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:BTNWRKFYLGFJXIL44KUJXO4RK6","target":"record","payload":{"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"},"canonical_sha256":"0cdb68a8b8598a9ba17ce2a89bbb9157ba12caa3cc37a861aa16db16c5ae3f17","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"},"source_kind":"arxiv","source_id":"1602.05016","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:20:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UtpD6KdJHaRHKk7UcLZEtkt80r3x+Jpu0i4ceDSN1lZjdBMICpW/wqLgsY28XZge+IYk3S9ZFdRxy0+j6UkADA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T22:51:00.460873Z"},"content_sha256":"be34d963218fbce08aac8738303205c6496e2ecf9013987f63efb032dcd311cb","schema_version":"1.0","event_id":"sha256:be34d963218fbce08aac8738303205c6496e2ecf9013987f63efb032dcd311cb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:BTNWRKFYLGFJXIL44KUJXO4RK6","target":"graph","payload":{"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"},"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:20:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qNeazKaKjj+kQf1goKuFLOxoC8haDZG25slOeZux+AyXQzzOkSm0mpNG+eJzKhSunJfUAE50MGmaotgiC4kbCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T22:51:00.461329Z"},"content_sha256":"457531b07cc792a2db6020fe25537b33a54062148fe081048f29a8a114f5b304","schema_version":"1.0","event_id":"sha256:457531b07cc792a2db6020fe25537b33a54062148fe081048f29a8a114f5b304"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BTNWRKFYLGFJXIL44KUJXO4RK6/bundle.json","state_url":"https://pith.science/pith/BTNWRKFYLGFJXIL44KUJXO4RK6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BTNWRKFYLGFJXIL44KUJXO4RK6/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-30T22:51:00Z","links":{"resolver":"https://pith.science/pith/BTNWRKFYLGFJXIL44KUJXO4RK6","bundle":"https://pith.science/pith/BTNWRKFYLGFJXIL44KUJXO4RK6/bundle.json","state":"https://pith.science/pith/BTNWRKFYLGFJXIL44KUJXO4RK6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BTNWRKFYLGFJXIL44KUJXO4RK6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:BTNWRKFYLGFJXIL44KUJXO4RK6","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":"5072875dbcb5b8dc83afeecfb545103b0055d8205cc848d6a43317d218ec5682","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-02-16T13:37:46Z","title_canon_sha256":"b8e1fb4a33bdf38b84972dd63cd188b6efc6377aecbffb68328c28c8ec864828"},"schema_version":"1.0","source":{"id":"1602.05016","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.05016","created_at":"2026-05-18T01:20:37Z"},{"alias_kind":"arxiv_version","alias_value":"1602.05016v1","created_at":"2026-05-18T01:20:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.05016","created_at":"2026-05-18T01:20:37Z"},{"alias_kind":"pith_short_12","alias_value":"BTNWRKFYLGFJ","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_16","alias_value":"BTNWRKFYLGFJXIL4","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_8","alias_value":"BTNWRKFY","created_at":"2026-05-18T12:30:09Z"}],"graph_snapshots":[{"event_id":"sha256:457531b07cc792a2db6020fe25537b33a54062148fe081048f29a8a114f5b304","target":"graph","created_at":"2026-05-18T01:20:37Z","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":"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","authors_text":"Alexander Golovnev, Alexander S. Kulikov, Arkadiusz Soca{\\l}a, Fedor V. Fomin, Ivan Mihajlin, Jakub Pachocki, Marek Cygan","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-02-16T13:37:46Z","title":"Tight Lower Bounds on Graph Embedding Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.05016","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:be34d963218fbce08aac8738303205c6496e2ecf9013987f63efb032dcd311cb","target":"record","created_at":"2026-05-18T01:20:37Z","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":"5072875dbcb5b8dc83afeecfb545103b0055d8205cc848d6a43317d218ec5682","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-02-16T13:37:46Z","title_canon_sha256":"b8e1fb4a33bdf38b84972dd63cd188b6efc6377aecbffb68328c28c8ec864828"},"schema_version":"1.0","source":{"id":"1602.05016","kind":"arxiv","version":1}},"canonical_sha256":"0cdb68a8b8598a9ba17ce2a89bbb9157ba12caa3cc37a861aa16db16c5ae3f17","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0cdb68a8b8598a9ba17ce2a89bbb9157ba12caa3cc37a861aa16db16c5ae3f17","first_computed_at":"2026-05-18T01:20:37.684283Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:20:37.684283Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"k37g2PozcrKn75TufOlUzYjp//UQSnEW/qUwj/ux9f7iigkF8jv+cRIqFvbLm3McCiwJnEXItzVDNC1J6UHWCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:20:37.684679Z","signed_message":"canonical_sha256_bytes"},"source_id":"1602.05016","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:be34d963218fbce08aac8738303205c6496e2ecf9013987f63efb032dcd311cb","sha256:457531b07cc792a2db6020fe25537b33a54062148fe081048f29a8a114f5b304"],"state_sha256":"104b8bdc2ee75f7bf3b5bbc365fa4535099c115f1f5d77bc15e7cbe5d49fd194"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jw+7xRrcTQD8WDYHTlPGR33D0St3vwh6kXgeGfeSaux4VrFk8eSliv4zJZeYyUFmt7QVqy74CPY8ZFbPfBWNCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T22:51:00.464340Z","bundle_sha256":"62ed8fd6e1a639cc5933ffa55262c6c9b233ae727d68facc68993ee31888a5b5"}}