{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:HFV4HPZCEEA2IYFWE46T7ZUPYM","short_pith_number":"pith:HFV4HPZC","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"},"canonical_sha256":"396bc3bf222101a460b6273d3fe68fc31474323cf8792de168368786395bf032","source":{"kind":"arxiv","id":"1706.05847","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:HFV4HPZCEEA2IYFWE46T7ZUPYM","target":"record","payload":{"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"},"canonical_sha256":"396bc3bf222101a460b6273d3fe68fc31474323cf8792de168368786395bf032","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"},"source_kind":"arxiv","source_id":"1706.05847","source_version":2,"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-18T00:39:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"I3IBWbsPv8EePgSMVqJbEwXrGyC69ty2RUBOEPhoDc9AsvPJ4UboaLGM2A9ygZmBKDXKgk+RuwXIQihZm+b9Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T08:28:48.376253Z"},"content_sha256":"425eacde130aff5e88c27c407e61b64785e8f0e1d582cf5d14bb05e4c6e61855","schema_version":"1.0","event_id":"sha256:425eacde130aff5e88c27c407e61b64785e8f0e1d582cf5d14bb05e4c6e61855"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:HFV4HPZCEEA2IYFWE46T7ZUPYM","target":"graph","payload":{"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"},"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-18T00:39:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FDUiX2vdWlxIepddquC+hG9BiBFlmsYOxL0iMfyrdg4+ASoCDAs9LEtVBewPd2tMru9Dw7J5p8LvAnkB7otjDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T08:28:48.376970Z"},"content_sha256":"dff40456a30fef3667310b9fd2867e0813c13c704c7874e5a5877d555185540e","schema_version":"1.0","event_id":"sha256:dff40456a30fef3667310b9fd2867e0813c13c704c7874e5a5877d555185540e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HFV4HPZCEEA2IYFWE46T7ZUPYM/bundle.json","state_url":"https://pith.science/pith/HFV4HPZCEEA2IYFWE46T7ZUPYM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HFV4HPZCEEA2IYFWE46T7ZUPYM/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-30T08:28:48Z","links":{"resolver":"https://pith.science/pith/HFV4HPZCEEA2IYFWE46T7ZUPYM","bundle":"https://pith.science/pith/HFV4HPZCEEA2IYFWE46T7ZUPYM/bundle.json","state":"https://pith.science/pith/HFV4HPZCEEA2IYFWE46T7ZUPYM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HFV4HPZCEEA2IYFWE46T7ZUPYM/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"G5eXBWJSdLjXw/NGzSOY4i00NHhGCeDr7DY2faE+1JB3aul0Z0QhyC4bpYDT+Yu6ZQXkL2Mavy/A6JaES/XeCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T08:28:48.380609Z","bundle_sha256":"4bd833cb1b9b6569ee3a6d2975911efef7b20c63ca3f753469395c4a58e3f398"}}