{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:6OFOQJZ7G44BXWPW33S3OZ4R6H","short_pith_number":"pith:6OFOQJZ7","canonical_record":{"source":{"id":"1612.07163","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-12-21T15:04:28Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"88c3207a91f707ec1becdcb16136f6fa49a89d6077e1e11907683587bc8da07b","abstract_canon_sha256":"535ea8f2c89a844603140e5b7dbb1affdb73a7db39ba7aafbbd80f0d869e7999"},"schema_version":"1.0"},"canonical_sha256":"f38ae8273f37381bd9f6dee5b76791f1eb645b789d2daf3dbad082b4bd579d16","source":{"kind":"arxiv","id":"1612.07163","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.07163","created_at":"2026-05-18T00:36:24Z"},{"alias_kind":"arxiv_version","alias_value":"1612.07163v2","created_at":"2026-05-18T00:36:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.07163","created_at":"2026-05-18T00:36:24Z"},{"alias_kind":"pith_short_12","alias_value":"6OFOQJZ7G44B","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_16","alias_value":"6OFOQJZ7G44BXWPW","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_8","alias_value":"6OFOQJZ7","created_at":"2026-05-18T12:30:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:6OFOQJZ7G44BXWPW33S3OZ4R6H","target":"record","payload":{"canonical_record":{"source":{"id":"1612.07163","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-12-21T15:04:28Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"88c3207a91f707ec1becdcb16136f6fa49a89d6077e1e11907683587bc8da07b","abstract_canon_sha256":"535ea8f2c89a844603140e5b7dbb1affdb73a7db39ba7aafbbd80f0d869e7999"},"schema_version":"1.0"},"canonical_sha256":"f38ae8273f37381bd9f6dee5b76791f1eb645b789d2daf3dbad082b4bd579d16","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:36:24.448930Z","signature_b64":"nJBk/m920tu4TOGIN8ecOFWJ2xVHq5N6v8pSWRipztaR8OGoS/BWvK0De10lsg6mxAjFtyqs3wQgcnMHFaR0BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f38ae8273f37381bd9f6dee5b76791f1eb645b789d2daf3dbad082b4bd579d16","last_reissued_at":"2026-05-18T00:36:24.448258Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:36:24.448258Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1612.07163","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:36:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9OsVdqG5HQkNQoA8FBfUXaEQXzkJIGJd+ODeJ7vmQauaVVwnIDF1J5/tpY3ZPuUCkKnlRDbI10FO4MEg7YeVDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T11:25:55.130060Z"},"content_sha256":"0d5d2372dc370338cae72520a8114a3babbf5d6feb35be604a0b574b2cebcb41","schema_version":"1.0","event_id":"sha256:0d5d2372dc370338cae72520a8114a3babbf5d6feb35be604a0b574b2cebcb41"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:6OFOQJZ7G44BXWPW33S3OZ4R6H","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Transmission and Storage Rates for Sequential Massive Random Access","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Aline Roumy, Elsa Dupraz, Michel Kieffer, Thomas Maugey","submitted_at":"2016-12-21T15:04:28Z","abstract_excerpt":"This paper introduces a new source coding paradigm called Sequential Massive Random Access (SMRA). In SMRA, a set of correlated sources is encoded once for all and stored on a server, and clients want to successively access to only a subset of the sources. Since the number of simultaneous clients can be huge, the server is only allowed to extract a bitstream from the stored data: no re-encoding can be performed before the transmission of the specific client's request. In this paper, we formally define the SMRA framework and introduce both storage and transmission rates to characterize the perf"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.07163","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:36:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XB0RkADApmNMUSCjEzFjjvnpxCj5cb2RCRwwT47UUCw9Zhtp1VQg1hfZ8XSBWQRkJ3bRRyL/pNSCcpqy7cJ4Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T11:25:55.130749Z"},"content_sha256":"d850366ff86e4eb2b3fdedcc861ef46628c3d592ead8cfb9fd322e4beae58965","schema_version":"1.0","event_id":"sha256:d850366ff86e4eb2b3fdedcc861ef46628c3d592ead8cfb9fd322e4beae58965"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6OFOQJZ7G44BXWPW33S3OZ4R6H/bundle.json","state_url":"https://pith.science/pith/6OFOQJZ7G44BXWPW33S3OZ4R6H/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6OFOQJZ7G44BXWPW33S3OZ4R6H/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-27T11:25:55Z","links":{"resolver":"https://pith.science/pith/6OFOQJZ7G44BXWPW33S3OZ4R6H","bundle":"https://pith.science/pith/6OFOQJZ7G44BXWPW33S3OZ4R6H/bundle.json","state":"https://pith.science/pith/6OFOQJZ7G44BXWPW33S3OZ4R6H/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6OFOQJZ7G44BXWPW33S3OZ4R6H/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:6OFOQJZ7G44BXWPW33S3OZ4R6H","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":"535ea8f2c89a844603140e5b7dbb1affdb73a7db39ba7aafbbd80f0d869e7999","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-12-21T15:04:28Z","title_canon_sha256":"88c3207a91f707ec1becdcb16136f6fa49a89d6077e1e11907683587bc8da07b"},"schema_version":"1.0","source":{"id":"1612.07163","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.07163","created_at":"2026-05-18T00:36:24Z"},{"alias_kind":"arxiv_version","alias_value":"1612.07163v2","created_at":"2026-05-18T00:36:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.07163","created_at":"2026-05-18T00:36:24Z"},{"alias_kind":"pith_short_12","alias_value":"6OFOQJZ7G44B","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_16","alias_value":"6OFOQJZ7G44BXWPW","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_8","alias_value":"6OFOQJZ7","created_at":"2026-05-18T12:30:01Z"}],"graph_snapshots":[{"event_id":"sha256:d850366ff86e4eb2b3fdedcc861ef46628c3d592ead8cfb9fd322e4beae58965","target":"graph","created_at":"2026-05-18T00:36: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":"This paper introduces a new source coding paradigm called Sequential Massive Random Access (SMRA). In SMRA, a set of correlated sources is encoded once for all and stored on a server, and clients want to successively access to only a subset of the sources. Since the number of simultaneous clients can be huge, the server is only allowed to extract a bitstream from the stored data: no re-encoding can be performed before the transmission of the specific client's request. In this paper, we formally define the SMRA framework and introduce both storage and transmission rates to characterize the perf","authors_text":"Aline Roumy, Elsa Dupraz, Michel Kieffer, Thomas Maugey","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-12-21T15:04:28Z","title":"Transmission and Storage Rates for Sequential Massive Random Access"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.07163","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:0d5d2372dc370338cae72520a8114a3babbf5d6feb35be604a0b574b2cebcb41","target":"record","created_at":"2026-05-18T00:36: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":"535ea8f2c89a844603140e5b7dbb1affdb73a7db39ba7aafbbd80f0d869e7999","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-12-21T15:04:28Z","title_canon_sha256":"88c3207a91f707ec1becdcb16136f6fa49a89d6077e1e11907683587bc8da07b"},"schema_version":"1.0","source":{"id":"1612.07163","kind":"arxiv","version":2}},"canonical_sha256":"f38ae8273f37381bd9f6dee5b76791f1eb645b789d2daf3dbad082b4bd579d16","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f38ae8273f37381bd9f6dee5b76791f1eb645b789d2daf3dbad082b4bd579d16","first_computed_at":"2026-05-18T00:36:24.448258Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:36:24.448258Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"nJBk/m920tu4TOGIN8ecOFWJ2xVHq5N6v8pSWRipztaR8OGoS/BWvK0De10lsg6mxAjFtyqs3wQgcnMHFaR0BA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:36:24.448930Z","signed_message":"canonical_sha256_bytes"},"source_id":"1612.07163","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0d5d2372dc370338cae72520a8114a3babbf5d6feb35be604a0b574b2cebcb41","sha256:d850366ff86e4eb2b3fdedcc861ef46628c3d592ead8cfb9fd322e4beae58965"],"state_sha256":"0bbb608e772e2e6c0193d55c096dc88a6f135c726db1fe99fcf80076234790f9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"u73KjrUCLNG3cs1QFpNTPrbL5UaXEEClGeNehMVtI8o2hUjwmfp4BFTZZ9Vs7BLhLUrkZC/DJRxY+tkqrbJhBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T11:25:55.134722Z","bundle_sha256":"fe7df1fec190fe61cb41da9253aaa9c5cad6f86c7ecf3d0da5569ed72221f45f"}}