{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:EBFVQA55TGS6FBTNDEEQP2CM7P","short_pith_number":"pith:EBFVQA55","canonical_record":{"source":{"id":"1402.0054","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-02-01T06:20:09Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"78e84ab4a27e56f07d4ca935fd21c082114d70249ef28383daf0a72c05695b29","abstract_canon_sha256":"7e182137a9539a8b178cc7fd542c2d69d92cc4c12734d75798363a68e22f7f36"},"schema_version":"1.0"},"canonical_sha256":"204b5803bd99a5e2866d190907e84cfbc4e9c45dddb797241cde55ddefea154a","source":{"kind":"arxiv","id":"1402.0054","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.0054","created_at":"2026-05-18T03:00:24Z"},{"alias_kind":"arxiv_version","alias_value":"1402.0054v1","created_at":"2026-05-18T03:00:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.0054","created_at":"2026-05-18T03:00:24Z"},{"alias_kind":"pith_short_12","alias_value":"EBFVQA55TGS6","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_16","alias_value":"EBFVQA55TGS6FBTN","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_8","alias_value":"EBFVQA55","created_at":"2026-05-18T12:28:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:EBFVQA55TGS6FBTNDEEQP2CM7P","target":"record","payload":{"canonical_record":{"source":{"id":"1402.0054","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-02-01T06:20:09Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"78e84ab4a27e56f07d4ca935fd21c082114d70249ef28383daf0a72c05695b29","abstract_canon_sha256":"7e182137a9539a8b178cc7fd542c2d69d92cc4c12734d75798363a68e22f7f36"},"schema_version":"1.0"},"canonical_sha256":"204b5803bd99a5e2866d190907e84cfbc4e9c45dddb797241cde55ddefea154a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:00:24.956004Z","signature_b64":"vnQdOjA4OMNjE4gz24qRR6dBQYz00VwsAPB/H3n1wB+QiKdl6oQw9Yah11F5k78mwJ2k4anFsEK6IJ2NsojvAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"204b5803bd99a5e2866d190907e84cfbc4e9c45dddb797241cde55ddefea154a","last_reissued_at":"2026-05-18T03:00:24.955147Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:00:24.955147Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1402.0054","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-18T03:00:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+q0v4V3rltUxaPUkRfBNTDZonRcVRnxN7+Fj/xIsW3ZiP/TTTB84A0StrjEi1zw7HNkmOFkLf4HQlB6ZBVANAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-19T08:15:23.597182Z"},"content_sha256":"d72a498266962882e8f2bd39867cf8a5db170628edf940cf408b3a1eed6e2808","schema_version":"1.0","event_id":"sha256:d72a498266962882e8f2bd39867cf8a5db170628edf940cf408b3a1eed6e2808"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:EBFVQA55TGS6FBTNDEEQP2CM7P","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Popular conjectures imply strong lower bounds for dynamic problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Amir Abboud, Virginia Vassilevska Williams","submitted_at":"2014-02-01T06:20:09Z","abstract_excerpt":"We consider several well-studied problems in dynamic algorithms and prove that sufficient progress on any of them would imply a breakthrough on one of five major open problems in the theory of algorithms:\n  1. Is the 3SUM problem on $n$ numbers in $O(n^{2-\\epsilon})$ time for some $\\epsilon>0$?\n  2. Can one determine the satisfiability of a CNF formula on $n$ variables in $O((2-\\epsilon)^n poly n)$ time for some $\\epsilon>0$?\n  3. Is the All Pairs Shortest Paths problem for graphs on $n$ vertices in $O(n^{3-\\epsilon})$ time for some $\\epsilon>0$?\n  4. Is there a linear time algorithm that dete"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.0054","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-18T03:00:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dBQDrkPVOolYiutv14yq0bSkOyFtvDfpUw3aOhrbNFr5zC2TkMAwbcLD2Dytxrjtc7W/125kiOj3UwD7DZEeCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-19T08:15:23.597652Z"},"content_sha256":"c3c4b6a094335cc9bfa01f63a7af9ed1e5d80258ff305f92d2c3ba18e6caa101","schema_version":"1.0","event_id":"sha256:c3c4b6a094335cc9bfa01f63a7af9ed1e5d80258ff305f92d2c3ba18e6caa101"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EBFVQA55TGS6FBTNDEEQP2CM7P/bundle.json","state_url":"https://pith.science/pith/EBFVQA55TGS6FBTNDEEQP2CM7P/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EBFVQA55TGS6FBTNDEEQP2CM7P/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-08-19T08:15:23Z","links":{"resolver":"https://pith.science/pith/EBFVQA55TGS6FBTNDEEQP2CM7P","bundle":"https://pith.science/pith/EBFVQA55TGS6FBTNDEEQP2CM7P/bundle.json","state":"https://pith.science/pith/EBFVQA55TGS6FBTNDEEQP2CM7P/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EBFVQA55TGS6FBTNDEEQP2CM7P/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:EBFVQA55TGS6FBTNDEEQP2CM7P","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":"7e182137a9539a8b178cc7fd542c2d69d92cc4c12734d75798363a68e22f7f36","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-02-01T06:20:09Z","title_canon_sha256":"78e84ab4a27e56f07d4ca935fd21c082114d70249ef28383daf0a72c05695b29"},"schema_version":"1.0","source":{"id":"1402.0054","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.0054","created_at":"2026-05-18T03:00:24Z"},{"alias_kind":"arxiv_version","alias_value":"1402.0054v1","created_at":"2026-05-18T03:00:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.0054","created_at":"2026-05-18T03:00:24Z"},{"alias_kind":"pith_short_12","alias_value":"EBFVQA55TGS6","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_16","alias_value":"EBFVQA55TGS6FBTN","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_8","alias_value":"EBFVQA55","created_at":"2026-05-18T12:28:25Z"}],"graph_snapshots":[{"event_id":"sha256:c3c4b6a094335cc9bfa01f63a7af9ed1e5d80258ff305f92d2c3ba18e6caa101","target":"graph","created_at":"2026-05-18T03:00:24Z","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 consider several well-studied problems in dynamic algorithms and prove that sufficient progress on any of them would imply a breakthrough on one of five major open problems in the theory of algorithms:\n  1. Is the 3SUM problem on $n$ numbers in $O(n^{2-\\epsilon})$ time for some $\\epsilon>0$?\n  2. Can one determine the satisfiability of a CNF formula on $n$ variables in $O((2-\\epsilon)^n poly n)$ time for some $\\epsilon>0$?\n  3. Is the All Pairs Shortest Paths problem for graphs on $n$ vertices in $O(n^{3-\\epsilon})$ time for some $\\epsilon>0$?\n  4. Is there a linear time algorithm that dete","authors_text":"Amir Abboud, Virginia Vassilevska Williams","cross_cats":["cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-02-01T06:20:09Z","title":"Popular conjectures imply strong lower bounds for dynamic problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.0054","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:d72a498266962882e8f2bd39867cf8a5db170628edf940cf408b3a1eed6e2808","target":"record","created_at":"2026-05-18T03:00:24Z","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":"7e182137a9539a8b178cc7fd542c2d69d92cc4c12734d75798363a68e22f7f36","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-02-01T06:20:09Z","title_canon_sha256":"78e84ab4a27e56f07d4ca935fd21c082114d70249ef28383daf0a72c05695b29"},"schema_version":"1.0","source":{"id":"1402.0054","kind":"arxiv","version":1}},"canonical_sha256":"204b5803bd99a5e2866d190907e84cfbc4e9c45dddb797241cde55ddefea154a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"204b5803bd99a5e2866d190907e84cfbc4e9c45dddb797241cde55ddefea154a","first_computed_at":"2026-05-18T03:00:24.955147Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:00:24.955147Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vnQdOjA4OMNjE4gz24qRR6dBQYz00VwsAPB/H3n1wB+QiKdl6oQw9Yah11F5k78mwJ2k4anFsEK6IJ2NsojvAA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:00:24.956004Z","signed_message":"canonical_sha256_bytes"},"source_id":"1402.0054","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d72a498266962882e8f2bd39867cf8a5db170628edf940cf408b3a1eed6e2808","sha256:c3c4b6a094335cc9bfa01f63a7af9ed1e5d80258ff305f92d2c3ba18e6caa101"],"state_sha256":"7fc08f7999d531aac3e09defd90acc2e8432558bbaacc903a27b10f83571a12a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Uwt0+rBuztPw/LY9/oO8QxOueyPfMPuNcae7kpvH0qduhrCyUP6TcTWgqhkngwf5dKkyK/4lSDRe/DOlFgQ2Cw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-19T08:15:23.601857Z","bundle_sha256":"f6d0f455dfc1c4905610e2a09d7e43dbf473448affec5c15ba4714707dff1c52"}}