{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:WYJS6COF357D6R7BZYFQOCPZZD","short_pith_number":"pith:WYJS6COF","canonical_record":{"source":{"id":"1507.03738","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-07-14T06:51:29Z","cross_cats_sorted":[],"title_canon_sha256":"e705f12bc10bb8f57a8a8667065754bc3ae53584974de8fc4cd9e55064d696a5","abstract_canon_sha256":"9f14c0024e1abffb19c24bce9d212687b18520d7f8791e7805adba5c460e8b79"},"schema_version":"1.0"},"canonical_sha256":"b6132f09c5df7e3f47e1ce0b0709f9c8ed0c6a3d175add3752ec6300123171d0","source":{"kind":"arxiv","id":"1507.03738","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.03738","created_at":"2026-05-18T01:36:57Z"},{"alias_kind":"arxiv_version","alias_value":"1507.03738v1","created_at":"2026-05-18T01:36:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.03738","created_at":"2026-05-18T01:36:57Z"},{"alias_kind":"pith_short_12","alias_value":"WYJS6COF357D","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_16","alias_value":"WYJS6COF357D6R7B","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_8","alias_value":"WYJS6COF","created_at":"2026-05-18T12:29:47Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:WYJS6COF357D6R7BZYFQOCPZZD","target":"record","payload":{"canonical_record":{"source":{"id":"1507.03738","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-07-14T06:51:29Z","cross_cats_sorted":[],"title_canon_sha256":"e705f12bc10bb8f57a8a8667065754bc3ae53584974de8fc4cd9e55064d696a5","abstract_canon_sha256":"9f14c0024e1abffb19c24bce9d212687b18520d7f8791e7805adba5c460e8b79"},"schema_version":"1.0"},"canonical_sha256":"b6132f09c5df7e3f47e1ce0b0709f9c8ed0c6a3d175add3752ec6300123171d0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:36:57.459757Z","signature_b64":"71bGiQn+hQ/SBxZIcanM/4gl8QoeVXGAfuqeI4hgSPz0anoC1NZtZOAE3sthiyZ875HgyM5Cq2sn6tmKomTsBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b6132f09c5df7e3f47e1ce0b0709f9c8ed0c6a3d175add3752ec6300123171d0","last_reissued_at":"2026-05-18T01:36:57.459142Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:36:57.459142Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1507.03738","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:36:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"H57CW6TeDIhYuOal7zRCHqybsATb8ClJstYWPstcLBx28TsITOw5VDZji/po9wcvVT8EXEty+xnJKjuUAcCSCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T21:02:01.386087Z"},"content_sha256":"227bc4c0b094fbad615c505e1416d80697c22bd7f972033d1e6ac954d7c16a36","schema_version":"1.0","event_id":"sha256:227bc4c0b094fbad615c505e1416d80697c22bd7f972033d1e6ac954d7c16a36"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:WYJS6COF357D6R7BZYFQOCPZZD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Tight Bounds for Subgraph Isomorphism and Graph Homomorphism","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-07-14T06:51:29Z","abstract_excerpt":"We prove that unless 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)|)}$. Combined with the reduction of Cygan, Pachocki, and Soca{\\l}a, our result rules out (subject to ETH) a possibility of $|V(G)|^{o(|V(G)|)}$-time algorithm deciding if graph $H$ is a subgraph of $G$. 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 complexity of these fundamental p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.03738","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:36:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+fsgdHW49PZPBB8KonlorjLhKKPXwaSAm5v8kesoQbPW5G3y2BoYX6n8TgE2TFR4ZD7DjH+WARW09xwenojbBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T21:02:01.386442Z"},"content_sha256":"b23ccf07443a93c9e62871e60f8b5d9ff117b97d58ea6db977b3e668684554c3","schema_version":"1.0","event_id":"sha256:b23ccf07443a93c9e62871e60f8b5d9ff117b97d58ea6db977b3e668684554c3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WYJS6COF357D6R7BZYFQOCPZZD/bundle.json","state_url":"https://pith.science/pith/WYJS6COF357D6R7BZYFQOCPZZD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WYJS6COF357D6R7BZYFQOCPZZD/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-19T21:02:01Z","links":{"resolver":"https://pith.science/pith/WYJS6COF357D6R7BZYFQOCPZZD","bundle":"https://pith.science/pith/WYJS6COF357D6R7BZYFQOCPZZD/bundle.json","state":"https://pith.science/pith/WYJS6COF357D6R7BZYFQOCPZZD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WYJS6COF357D6R7BZYFQOCPZZD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:WYJS6COF357D6R7BZYFQOCPZZD","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":"9f14c0024e1abffb19c24bce9d212687b18520d7f8791e7805adba5c460e8b79","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-07-14T06:51:29Z","title_canon_sha256":"e705f12bc10bb8f57a8a8667065754bc3ae53584974de8fc4cd9e55064d696a5"},"schema_version":"1.0","source":{"id":"1507.03738","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.03738","created_at":"2026-05-18T01:36:57Z"},{"alias_kind":"arxiv_version","alias_value":"1507.03738v1","created_at":"2026-05-18T01:36:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.03738","created_at":"2026-05-18T01:36:57Z"},{"alias_kind":"pith_short_12","alias_value":"WYJS6COF357D","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_16","alias_value":"WYJS6COF357D6R7B","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_8","alias_value":"WYJS6COF","created_at":"2026-05-18T12:29:47Z"}],"graph_snapshots":[{"event_id":"sha256:b23ccf07443a93c9e62871e60f8b5d9ff117b97d58ea6db977b3e668684554c3","target":"graph","created_at":"2026-05-18T01:36:57Z","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 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)|)}$. Combined with the reduction of Cygan, Pachocki, and Soca{\\l}a, our result rules out (subject to ETH) a possibility of $|V(G)|^{o(|V(G)|)}$-time algorithm deciding if graph $H$ is a subgraph of $G$. 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 complexity of these fundamental p","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-07-14T06:51:29Z","title":"Tight Bounds for Subgraph Isomorphism and Graph Homomorphism"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.03738","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:227bc4c0b094fbad615c505e1416d80697c22bd7f972033d1e6ac954d7c16a36","target":"record","created_at":"2026-05-18T01:36:57Z","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":"9f14c0024e1abffb19c24bce9d212687b18520d7f8791e7805adba5c460e8b79","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-07-14T06:51:29Z","title_canon_sha256":"e705f12bc10bb8f57a8a8667065754bc3ae53584974de8fc4cd9e55064d696a5"},"schema_version":"1.0","source":{"id":"1507.03738","kind":"arxiv","version":1}},"canonical_sha256":"b6132f09c5df7e3f47e1ce0b0709f9c8ed0c6a3d175add3752ec6300123171d0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b6132f09c5df7e3f47e1ce0b0709f9c8ed0c6a3d175add3752ec6300123171d0","first_computed_at":"2026-05-18T01:36:57.459142Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:36:57.459142Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"71bGiQn+hQ/SBxZIcanM/4gl8QoeVXGAfuqeI4hgSPz0anoC1NZtZOAE3sthiyZ875HgyM5Cq2sn6tmKomTsBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:36:57.459757Z","signed_message":"canonical_sha256_bytes"},"source_id":"1507.03738","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:227bc4c0b094fbad615c505e1416d80697c22bd7f972033d1e6ac954d7c16a36","sha256:b23ccf07443a93c9e62871e60f8b5d9ff117b97d58ea6db977b3e668684554c3"],"state_sha256":"f72c14c0ef2b5fbca15d4bfc522449ed2f9926552b6e2d66ceb9103c8abc2097"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"thKUa5eY6UorvzDOXN1kL+fAHJI5p/PmI9v2Feea907P2OP0CIk3a6uZGB4wuUxA0lUqISGFXDv1C4jr44RKBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-19T21:02:01.388511Z","bundle_sha256":"7dceab3cf52830fe49e4c650455056e0ea55def70242253d2f18b06b09e3b7ad"}}