{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:O6P2UQMQNG6RBIBGL6AJTP6QU2","short_pith_number":"pith:O6P2UQMQ","canonical_record":{"source":{"id":"1504.01836","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-04-08T06:03:56Z","cross_cats_sorted":["cs.CC","cs.IT","math.IT"],"title_canon_sha256":"92e4b1e1bd2a161c9bbe8434b382b7e191584f240bbf7f31e06c165de448e2ee","abstract_canon_sha256":"4b1bfa8a97c40f605ac3eaed49f0d5d84e9a120f411ad16adc730a8094f6dd7c"},"schema_version":"1.0"},"canonical_sha256":"779faa419069bd10a0265f8099bfd0a6b215e82f7e4675f88288ba4b9506d8fc","source":{"kind":"arxiv","id":"1504.01836","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.01836","created_at":"2026-05-18T02:19:18Z"},{"alias_kind":"arxiv_version","alias_value":"1504.01836v1","created_at":"2026-05-18T02:19:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.01836","created_at":"2026-05-18T02:19:18Z"},{"alias_kind":"pith_short_12","alias_value":"O6P2UQMQNG6R","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_16","alias_value":"O6P2UQMQNG6RBIBG","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_8","alias_value":"O6P2UQMQ","created_at":"2026-05-18T12:29:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:O6P2UQMQNG6RBIBGL6AJTP6QU2","target":"record","payload":{"canonical_record":{"source":{"id":"1504.01836","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-04-08T06:03:56Z","cross_cats_sorted":["cs.CC","cs.IT","math.IT"],"title_canon_sha256":"92e4b1e1bd2a161c9bbe8434b382b7e191584f240bbf7f31e06c165de448e2ee","abstract_canon_sha256":"4b1bfa8a97c40f605ac3eaed49f0d5d84e9a120f411ad16adc730a8094f6dd7c"},"schema_version":"1.0"},"canonical_sha256":"779faa419069bd10a0265f8099bfd0a6b215e82f7e4675f88288ba4b9506d8fc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:19:18.083570Z","signature_b64":"kqjO/s/YVR8I8ikO+OLxxhGYcogw7T05GjYud4dVUTrpe5Vk39Obj4L8bMPZRZ04IMQhTx52dkiAYuOq2yE5Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"779faa419069bd10a0265f8099bfd0a6b215e82f7e4675f88288ba4b9506d8fc","last_reissued_at":"2026-05-18T02:19:18.083048Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:19:18.083048Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1504.01836","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-18T02:19:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aIojQX7pBYpn6nsg5DsvlsK/1juKzytFxWHlhTxDmiGUIHlVT5sHSzCzT4ufiM8QzDAFqjwiVfKeNECbLGjiAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T03:05:05.783059Z"},"content_sha256":"afabacf993cfb6eb455d5ff6d12df9279ad9bb3d44b8c618c1c3d7c6cb87e567","schema_version":"1.0","event_id":"sha256:afabacf993cfb6eb455d5ff6d12df9279ad9bb3d44b8c618c1c3d7c6cb87e567"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:O6P2UQMQNG6RBIBGL6AJTP6QU2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"New Unconditional Hardness Results for Dynamic and Online Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.IT","math.IT"],"primary_cat":"cs.DS","authors_text":"Allan Gr{\\o}nlund, Kasper Green Larsen, Raphael Clifford","submitted_at":"2015-04-08T06:03:56Z","abstract_excerpt":"There has been a resurgence of interest in lower bounds whose truth rests on the conjectured hardness of well known computational problems. These conditional lower bounds have become important and popular due to the painfully slow progress on proving strong unconditional lower bounds. Nevertheless, the long term goal is to replace these conditional bounds with unconditional ones. In this paper we make progress in this direction by studying the cell probe complexity of two conjectured to be hard problems of particular importance: matrix-vector multiplication and a version of dynamic set disjoin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.01836","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-18T02:19:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LDnZqDvzOe6kPFVY5mPpgSlrqUEn4sQfn40t1TwU5uzdpasj5olAZJndiw6Id8H89f6DVSmWOCfL/5XLo1NICg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T03:05:05.783719Z"},"content_sha256":"122d1fb5eca6fafe1791898967f0b246140f2464dd04d1ae7e0eefa9d5d6c607","schema_version":"1.0","event_id":"sha256:122d1fb5eca6fafe1791898967f0b246140f2464dd04d1ae7e0eefa9d5d6c607"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/O6P2UQMQNG6RBIBGL6AJTP6QU2/bundle.json","state_url":"https://pith.science/pith/O6P2UQMQNG6RBIBGL6AJTP6QU2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/O6P2UQMQNG6RBIBGL6AJTP6QU2/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-25T03:05:05Z","links":{"resolver":"https://pith.science/pith/O6P2UQMQNG6RBIBGL6AJTP6QU2","bundle":"https://pith.science/pith/O6P2UQMQNG6RBIBGL6AJTP6QU2/bundle.json","state":"https://pith.science/pith/O6P2UQMQNG6RBIBGL6AJTP6QU2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/O6P2UQMQNG6RBIBGL6AJTP6QU2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:O6P2UQMQNG6RBIBGL6AJTP6QU2","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":"4b1bfa8a97c40f605ac3eaed49f0d5d84e9a120f411ad16adc730a8094f6dd7c","cross_cats_sorted":["cs.CC","cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-04-08T06:03:56Z","title_canon_sha256":"92e4b1e1bd2a161c9bbe8434b382b7e191584f240bbf7f31e06c165de448e2ee"},"schema_version":"1.0","source":{"id":"1504.01836","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.01836","created_at":"2026-05-18T02:19:18Z"},{"alias_kind":"arxiv_version","alias_value":"1504.01836v1","created_at":"2026-05-18T02:19:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.01836","created_at":"2026-05-18T02:19:18Z"},{"alias_kind":"pith_short_12","alias_value":"O6P2UQMQNG6R","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_16","alias_value":"O6P2UQMQNG6RBIBG","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_8","alias_value":"O6P2UQMQ","created_at":"2026-05-18T12:29:34Z"}],"graph_snapshots":[{"event_id":"sha256:122d1fb5eca6fafe1791898967f0b246140f2464dd04d1ae7e0eefa9d5d6c607","target":"graph","created_at":"2026-05-18T02:19:18Z","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":"There has been a resurgence of interest in lower bounds whose truth rests on the conjectured hardness of well known computational problems. These conditional lower bounds have become important and popular due to the painfully slow progress on proving strong unconditional lower bounds. Nevertheless, the long term goal is to replace these conditional bounds with unconditional ones. In this paper we make progress in this direction by studying the cell probe complexity of two conjectured to be hard problems of particular importance: matrix-vector multiplication and a version of dynamic set disjoin","authors_text":"Allan Gr{\\o}nlund, Kasper Green Larsen, Raphael Clifford","cross_cats":["cs.CC","cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-04-08T06:03:56Z","title":"New Unconditional Hardness Results for Dynamic and Online Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.01836","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:afabacf993cfb6eb455d5ff6d12df9279ad9bb3d44b8c618c1c3d7c6cb87e567","target":"record","created_at":"2026-05-18T02:19:18Z","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":"4b1bfa8a97c40f605ac3eaed49f0d5d84e9a120f411ad16adc730a8094f6dd7c","cross_cats_sorted":["cs.CC","cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-04-08T06:03:56Z","title_canon_sha256":"92e4b1e1bd2a161c9bbe8434b382b7e191584f240bbf7f31e06c165de448e2ee"},"schema_version":"1.0","source":{"id":"1504.01836","kind":"arxiv","version":1}},"canonical_sha256":"779faa419069bd10a0265f8099bfd0a6b215e82f7e4675f88288ba4b9506d8fc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"779faa419069bd10a0265f8099bfd0a6b215e82f7e4675f88288ba4b9506d8fc","first_computed_at":"2026-05-18T02:19:18.083048Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:19:18.083048Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kqjO/s/YVR8I8ikO+OLxxhGYcogw7T05GjYud4dVUTrpe5Vk39Obj4L8bMPZRZ04IMQhTx52dkiAYuOq2yE5Cw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:19:18.083570Z","signed_message":"canonical_sha256_bytes"},"source_id":"1504.01836","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:afabacf993cfb6eb455d5ff6d12df9279ad9bb3d44b8c618c1c3d7c6cb87e567","sha256:122d1fb5eca6fafe1791898967f0b246140f2464dd04d1ae7e0eefa9d5d6c607"],"state_sha256":"99cd08390502d79274095815061c05c4de712fe81bcb395d067cd3d95d4de3d6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2fv9aUmrbBTQbn7cR5EYy4Twj16Q5lmnOtmdiGP+r2SEYHG74EEjBJruhVQKshbXFHL5aU1aSaXLDGEp4Da2CQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T03:05:05.786644Z","bundle_sha256":"ae19cb20a0cbadb4aff88d917d2cb3486b6864022e786e77bdafb0d271ba743f"}}