{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:HFV4HPZCEEA2IYFWE46T7ZUPYM","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":"f1c680c0d32d4415271c16ede336d8c66cd9a5337839e1a476aacf221a702b5f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-06-19T09:34:05Z","title_canon_sha256":"98ae07076fa6c1b964b701313833be13f4bc62838d4fbdd5b53838517cc3e881"},"schema_version":"1.0","source":{"id":"1706.05847","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.05847","created_at":"2026-05-18T00:39:31Z"},{"alias_kind":"arxiv_version","alias_value":"1706.05847v2","created_at":"2026-05-18T00:39:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.05847","created_at":"2026-05-18T00:39:31Z"},{"alias_kind":"pith_short_12","alias_value":"HFV4HPZCEEA2","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_16","alias_value":"HFV4HPZCEEA2IYFW","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_8","alias_value":"HFV4HPZC","created_at":"2026-05-18T12:31:18Z"}],"graph_snapshots":[{"event_id":"sha256:dff40456a30fef3667310b9fd2867e0813c13c704c7874e5a5877d555185540e","target":"graph","created_at":"2026-05-18T00:39:31Z","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 recent years much effort has been concentrated towards achieving polynomial time lower bounds on algorithms for solving various well-known problems. A useful technique for showing such lower bounds is to prove them conditionally based on well-studied hardness assumptions such as 3SUM, APSP, SETH, etc. This line of research helps to obtain a better understanding of the complexity inside P.\n  A related question asks to prove conditional space lower bounds on data structures that are constructed to solve certain algorithmic tasks after an initial preprocessing stage. This question received lit","authors_text":"Ely Porat, Isaac Goldstein, Moshe Lewenstein, Tsvi Kopelowitz","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-06-19T09:34:05Z","title":"Conditional Lower Bounds for Space/Time Tradeoffs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.05847","kind":"arxiv","version":2},"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:425eacde130aff5e88c27c407e61b64785e8f0e1d582cf5d14bb05e4c6e61855","target":"record","created_at":"2026-05-18T00:39:31Z","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":"f1c680c0d32d4415271c16ede336d8c66cd9a5337839e1a476aacf221a702b5f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-06-19T09:34:05Z","title_canon_sha256":"98ae07076fa6c1b964b701313833be13f4bc62838d4fbdd5b53838517cc3e881"},"schema_version":"1.0","source":{"id":"1706.05847","kind":"arxiv","version":2}},"canonical_sha256":"396bc3bf222101a460b6273d3fe68fc31474323cf8792de168368786395bf032","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"396bc3bf222101a460b6273d3fe68fc31474323cf8792de168368786395bf032","first_computed_at":"2026-05-18T00:39:31.427491Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:39:31.427491Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7OWyPEpHGThjj9SbbPRxXNslwh2oM9FPzAxajm58MwpkHyl5/fn2IdmScCC2yiKwf+cwMYOYd/Wnj4V7IT4lCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:39:31.428023Z","signed_message":"canonical_sha256_bytes"},"source_id":"1706.05847","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:425eacde130aff5e88c27c407e61b64785e8f0e1d582cf5d14bb05e4c6e61855","sha256:dff40456a30fef3667310b9fd2867e0813c13c704c7874e5a5877d555185540e"],"state_sha256":"a3f32590fdeedd1a69faec2488139e737db0ee1cacab2a1479b9370256b4d8b3"}