{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:TFBB7JTSTWYDAMTO3K5YIQZCQZ","short_pith_number":"pith:TFBB7JTS","canonical_record":{"source":{"id":"1803.00796","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-03-02T10:32:07Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"6e1126ba93b674baa29029bbb5f90c50ed903153ee8167df1aeac713d061ddf8","abstract_canon_sha256":"debd283a2eca1ee54567d6aa01e380e25242a14f6bf5d1caca33256088730e07"},"schema_version":"1.0"},"canonical_sha256":"99421fa6729db030326edabb844322864aaab7066f5e9522f9bcf13b4bde3d53","source":{"kind":"arxiv","id":"1803.00796","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.00796","created_at":"2026-05-18T00:22:07Z"},{"alias_kind":"arxiv_version","alias_value":"1803.00796v1","created_at":"2026-05-18T00:22:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.00796","created_at":"2026-05-18T00:22:07Z"},{"alias_kind":"pith_short_12","alias_value":"TFBB7JTSTWYD","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_16","alias_value":"TFBB7JTSTWYDAMTO","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_8","alias_value":"TFBB7JTS","created_at":"2026-05-18T12:32:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:TFBB7JTSTWYDAMTO3K5YIQZCQZ","target":"record","payload":{"canonical_record":{"source":{"id":"1803.00796","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-03-02T10:32:07Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"6e1126ba93b674baa29029bbb5f90c50ed903153ee8167df1aeac713d061ddf8","abstract_canon_sha256":"debd283a2eca1ee54567d6aa01e380e25242a14f6bf5d1caca33256088730e07"},"schema_version":"1.0"},"canonical_sha256":"99421fa6729db030326edabb844322864aaab7066f5e9522f9bcf13b4bde3d53","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:22:07.853813Z","signature_b64":"F6DYbYZIpsmat0NFjPCF9L8tCLnkuL7qnr5DDwVMs46GNAQYueNilRl8LmV7tzKz7Rt/x6OETnEeEJ+Y3uG1DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"99421fa6729db030326edabb844322864aaab7066f5e9522f9bcf13b4bde3d53","last_reissued_at":"2026-05-18T00:22:07.853170Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:22:07.853170Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1803.00796","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-18T00:22:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hlDKw8GTHyNsx1oGCya32hwnClYVkSKgHjZdCzG+5Ex81FMYHkEMvUsAyT1/T+WjMTM0xcGz5qxAFC3P0MEpDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T10:58:16.720118Z"},"content_sha256":"3515636a77ad8683aeae42bcd66ee249d1f36345a1a9f795cbef6a03860b0058","schema_version":"1.0","event_id":"sha256:3515636a77ad8683aeae42bcd66ee249d1f36345a1a9f795cbef6a03860b0058"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:TFBB7JTSTWYDAMTO3K5YIQZCQZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fine-Grained Complexity of Analyzing Compressed Data: Quantifying Improvements over Decompress-And-Solve","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Amir Abboud, Arturs Backurs, Karl Bringmann, Marvin K\\\"unnemann","submitted_at":"2018-03-02T10:32:07Z","abstract_excerpt":"Can we analyze data without decompressing it? As our data keeps growing, understanding the time complexity of problems on compressed inputs, rather than in convenient uncompressed forms, becomes more and more relevant. Suppose we are given a compression of size $n$ of data that originally has size $N$, and we want to solve a problem with time complexity $T(\\cdot)$. The naive strategy of \"decompress-and-solve\" gives time $T(N)$, whereas \"the gold standard\" is time $T(n)$: to analyze the compression as efficiently as if the original data was small.\n  We restrict our attention to data in the form"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.00796","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-18T00:22:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZUP2nz1LbSYjzu4ef70liq7W0xFCPYp24anSE4qrL4H4RAJK40iqH8JmJuy2ilVuMoDWQ4M1nrGeZR47kpAZAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T10:58:16.720788Z"},"content_sha256":"4211c10ccac958d259f29779236d6fbc35491db81c1d7d0d274f9cdd1fc49520","schema_version":"1.0","event_id":"sha256:4211c10ccac958d259f29779236d6fbc35491db81c1d7d0d274f9cdd1fc49520"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TFBB7JTSTWYDAMTO3K5YIQZCQZ/bundle.json","state_url":"https://pith.science/pith/TFBB7JTSTWYDAMTO3K5YIQZCQZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TFBB7JTSTWYDAMTO3K5YIQZCQZ/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-25T10:58:16Z","links":{"resolver":"https://pith.science/pith/TFBB7JTSTWYDAMTO3K5YIQZCQZ","bundle":"https://pith.science/pith/TFBB7JTSTWYDAMTO3K5YIQZCQZ/bundle.json","state":"https://pith.science/pith/TFBB7JTSTWYDAMTO3K5YIQZCQZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TFBB7JTSTWYDAMTO3K5YIQZCQZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:TFBB7JTSTWYDAMTO3K5YIQZCQZ","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":"debd283a2eca1ee54567d6aa01e380e25242a14f6bf5d1caca33256088730e07","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-03-02T10:32:07Z","title_canon_sha256":"6e1126ba93b674baa29029bbb5f90c50ed903153ee8167df1aeac713d061ddf8"},"schema_version":"1.0","source":{"id":"1803.00796","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.00796","created_at":"2026-05-18T00:22:07Z"},{"alias_kind":"arxiv_version","alias_value":"1803.00796v1","created_at":"2026-05-18T00:22:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.00796","created_at":"2026-05-18T00:22:07Z"},{"alias_kind":"pith_short_12","alias_value":"TFBB7JTSTWYD","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_16","alias_value":"TFBB7JTSTWYDAMTO","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_8","alias_value":"TFBB7JTS","created_at":"2026-05-18T12:32:53Z"}],"graph_snapshots":[{"event_id":"sha256:4211c10ccac958d259f29779236d6fbc35491db81c1d7d0d274f9cdd1fc49520","target":"graph","created_at":"2026-05-18T00:22:07Z","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":"Can we analyze data without decompressing it? As our data keeps growing, understanding the time complexity of problems on compressed inputs, rather than in convenient uncompressed forms, becomes more and more relevant. Suppose we are given a compression of size $n$ of data that originally has size $N$, and we want to solve a problem with time complexity $T(\\cdot)$. The naive strategy of \"decompress-and-solve\" gives time $T(N)$, whereas \"the gold standard\" is time $T(n)$: to analyze the compression as efficiently as if the original data was small.\n  We restrict our attention to data in the form","authors_text":"Amir Abboud, Arturs Backurs, Karl Bringmann, Marvin K\\\"unnemann","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-03-02T10:32:07Z","title":"Fine-Grained Complexity of Analyzing Compressed Data: Quantifying Improvements over Decompress-And-Solve"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.00796","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:3515636a77ad8683aeae42bcd66ee249d1f36345a1a9f795cbef6a03860b0058","target":"record","created_at":"2026-05-18T00:22:07Z","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":"debd283a2eca1ee54567d6aa01e380e25242a14f6bf5d1caca33256088730e07","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-03-02T10:32:07Z","title_canon_sha256":"6e1126ba93b674baa29029bbb5f90c50ed903153ee8167df1aeac713d061ddf8"},"schema_version":"1.0","source":{"id":"1803.00796","kind":"arxiv","version":1}},"canonical_sha256":"99421fa6729db030326edabb844322864aaab7066f5e9522f9bcf13b4bde3d53","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"99421fa6729db030326edabb844322864aaab7066f5e9522f9bcf13b4bde3d53","first_computed_at":"2026-05-18T00:22:07.853170Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:22:07.853170Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"F6DYbYZIpsmat0NFjPCF9L8tCLnkuL7qnr5DDwVMs46GNAQYueNilRl8LmV7tzKz7Rt/x6OETnEeEJ+Y3uG1DA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:22:07.853813Z","signed_message":"canonical_sha256_bytes"},"source_id":"1803.00796","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3515636a77ad8683aeae42bcd66ee249d1f36345a1a9f795cbef6a03860b0058","sha256:4211c10ccac958d259f29779236d6fbc35491db81c1d7d0d274f9cdd1fc49520"],"state_sha256":"3152b004c6a789ee91a20aa481afd2b09c66d47b6ba108fd121ed7ff40532cf1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hRx7MBqLce0ePgL0kfWWU3RLJ3/9ZpL9wnzpSFIhc9BC7bXxWUjG9hGv+rEVTHL4vWvt0yqVh3WiwNNHjv+3CQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T10:58:16.724556Z","bundle_sha256":"06433e8f1ca0d077c993d736ae0ad0ad61e20c037523e42147635cac8c6f8592"}}