{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:HFV4HPZCEEA2IYFWE46T7ZUPYM","short_pith_number":"pith:HFV4HPZC","schema_version":"1.0","canonical_sha256":"396bc3bf222101a460b6273d3fe68fc31474323cf8792de168368786395bf032","source":{"kind":"arxiv","id":"1706.05847","version":2},"attestation_state":"computed","paper":{"title":"Conditional Lower Bounds for Space/Time Tradeoffs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Ely Porat, Isaac Goldstein, Moshe Lewenstein, Tsvi Kopelowitz","submitted_at":"2017-06-19T09:34:05Z","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"},"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":"1706.05847","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-06-19T09:34:05Z","cross_cats_sorted":[],"title_canon_sha256":"98ae07076fa6c1b964b701313833be13f4bc62838d4fbdd5b53838517cc3e881","abstract_canon_sha256":"f1c680c0d32d4415271c16ede336d8c66cd9a5337839e1a476aacf221a702b5f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:39:31.428023Z","signature_b64":"7OWyPEpHGThjj9SbbPRxXNslwh2oM9FPzAxajm58MwpkHyl5/fn2IdmScCC2yiKwf+cwMYOYd/Wnj4V7IT4lCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"396bc3bf222101a460b6273d3fe68fc31474323cf8792de168368786395bf032","last_reissued_at":"2026-05-18T00:39:31.427491Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:39:31.427491Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Conditional Lower Bounds for Space/Time Tradeoffs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Ely Porat, Isaac Goldstein, Moshe Lewenstein, Tsvi Kopelowitz","submitted_at":"2017-06-19T09:34:05Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.05847","kind":"arxiv","version":2},"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":"1706.05847","created_at":"2026-05-18T00:39:31.427571+00:00"},{"alias_kind":"arxiv_version","alias_value":"1706.05847v2","created_at":"2026-05-18T00:39:31.427571+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.05847","created_at":"2026-05-18T00:39:31.427571+00:00"},{"alias_kind":"pith_short_12","alias_value":"HFV4HPZCEEA2","created_at":"2026-05-18T12:31:18.294218+00:00"},{"alias_kind":"pith_short_16","alias_value":"HFV4HPZCEEA2IYFW","created_at":"2026-05-18T12:31:18.294218+00:00"},{"alias_kind":"pith_short_8","alias_value":"HFV4HPZC","created_at":"2026-05-18T12:31:18.294218+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/HFV4HPZCEEA2IYFWE46T7ZUPYM","json":"https://pith.science/pith/HFV4HPZCEEA2IYFWE46T7ZUPYM.json","graph_json":"https://pith.science/api/pith-number/HFV4HPZCEEA2IYFWE46T7ZUPYM/graph.json","events_json":"https://pith.science/api/pith-number/HFV4HPZCEEA2IYFWE46T7ZUPYM/events.json","paper":"https://pith.science/paper/HFV4HPZC"},"agent_actions":{"view_html":"https://pith.science/pith/HFV4HPZCEEA2IYFWE46T7ZUPYM","download_json":"https://pith.science/pith/HFV4HPZCEEA2IYFWE46T7ZUPYM.json","view_paper":"https://pith.science/paper/HFV4HPZC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1706.05847&json=true","fetch_graph":"https://pith.science/api/pith-number/HFV4HPZCEEA2IYFWE46T7ZUPYM/graph.json","fetch_events":"https://pith.science/api/pith-number/HFV4HPZCEEA2IYFWE46T7ZUPYM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HFV4HPZCEEA2IYFWE46T7ZUPYM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HFV4HPZCEEA2IYFWE46T7ZUPYM/action/storage_attestation","attest_author":"https://pith.science/pith/HFV4HPZCEEA2IYFWE46T7ZUPYM/action/author_attestation","sign_citation":"https://pith.science/pith/HFV4HPZCEEA2IYFWE46T7ZUPYM/action/citation_signature","submit_replication":"https://pith.science/pith/HFV4HPZCEEA2IYFWE46T7ZUPYM/action/replication_record"}},"created_at":"2026-05-18T00:39:31.427571+00:00","updated_at":"2026-05-18T00:39:31.427571+00:00"}