{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:6L52CGOKQJSLLYTRRIFBGDYDXD","short_pith_number":"pith:6L52CGOK","canonical_record":{"source":{"id":"1302.0103","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2013-02-01T07:51:58Z","cross_cats_sorted":[],"title_canon_sha256":"2bf9fca7434d962e74065d9961d232a4809e5dd2387d69c666c74b27c8e5d33a","abstract_canon_sha256":"959c5165b4b000874ff4c454d16e8012a79d92eae94fa929422802c33ac13476"},"schema_version":"1.0"},"canonical_sha256":"f2fba119ca8264b5e2718a0a130f03b8d10c07de2a40f88e63b5e5cb5b4a1750","source":{"kind":"arxiv","id":"1302.0103","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.0103","created_at":"2026-05-18T03:33:13Z"},{"alias_kind":"arxiv_version","alias_value":"1302.0103v2","created_at":"2026-05-18T03:33:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.0103","created_at":"2026-05-18T03:33:13Z"},{"alias_kind":"pith_short_12","alias_value":"6L52CGOKQJSL","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_16","alias_value":"6L52CGOKQJSLLYTR","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_8","alias_value":"6L52CGOK","created_at":"2026-05-18T12:27:36Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:6L52CGOKQJSLLYTRRIFBGDYDXD","target":"record","payload":{"canonical_record":{"source":{"id":"1302.0103","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2013-02-01T07:51:58Z","cross_cats_sorted":[],"title_canon_sha256":"2bf9fca7434d962e74065d9961d232a4809e5dd2387d69c666c74b27c8e5d33a","abstract_canon_sha256":"959c5165b4b000874ff4c454d16e8012a79d92eae94fa929422802c33ac13476"},"schema_version":"1.0"},"canonical_sha256":"f2fba119ca8264b5e2718a0a130f03b8d10c07de2a40f88e63b5e5cb5b4a1750","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:33:13.428624Z","signature_b64":"/g0aO5qW3bKEfPJMDUqguN/RGHvLLgC+bozWNX5vafYvNUo0m6bBodFNuHvGYHYNpKVQ9ISZSzFqmW2rbBQSCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f2fba119ca8264b5e2718a0a130f03b8d10c07de2a40f88e63b5e5cb5b4a1750","last_reissued_at":"2026-05-18T03:33:13.427556Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:33:13.427556Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1302.0103","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-18T03:33:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"32v6au309F9/A6Foc3PXZRiDyyGfy8g6sQvZyFX80M5bxGDjsiARuo2WyufRb3y3/HAOImhxQvNyPVMzT5nNDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T17:21:52.624122Z"},"content_sha256":"b43c1d6126947834d3161bb168a511f42ca5f504550607b0b3604418e24a4623","schema_version":"1.0","event_id":"sha256:b43c1d6126947834d3161bb168a511f42ca5f504550607b0b3604418e24a4623"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:6L52CGOKQJSLLYTRRIFBGDYDXD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Survey on Array Storage, Query Languages, and Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Florin Rusu, Yu Cheng","submitted_at":"2013-02-01T07:51:58Z","abstract_excerpt":"Since scientific investigation is one of the most important providers of massive amounts of ordered data, there is a renewed interest in array data processing in the context of Big Data. To the best of our knowledge, a unified resource that summarizes and analyzes array processing research over its long existence is currently missing. In this survey, we provide a guide for past, present, and future research in array processing. The survey is organized along three main topics. Array storage discusses all the aspects related to array partitioning into chunks. The identification of a reduced set "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.0103","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-18T03:33:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QLsZCJgbdWP5nHP95BRAG3efvOq/cTmJKekt8gA11tC84oHAPcFVlwz7c2KzvF80qfuuCTczF2bW1/owmHsLDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T17:21:52.624792Z"},"content_sha256":"da2b867d38818cdbe41aadfa2b8257cbbf20233e52ac1770a52c9f0630a723d6","schema_version":"1.0","event_id":"sha256:da2b867d38818cdbe41aadfa2b8257cbbf20233e52ac1770a52c9f0630a723d6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6L52CGOKQJSLLYTRRIFBGDYDXD/bundle.json","state_url":"https://pith.science/pith/6L52CGOKQJSLLYTRRIFBGDYDXD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6L52CGOKQJSLLYTRRIFBGDYDXD/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-26T17:21:52Z","links":{"resolver":"https://pith.science/pith/6L52CGOKQJSLLYTRRIFBGDYDXD","bundle":"https://pith.science/pith/6L52CGOKQJSLLYTRRIFBGDYDXD/bundle.json","state":"https://pith.science/pith/6L52CGOKQJSLLYTRRIFBGDYDXD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6L52CGOKQJSLLYTRRIFBGDYDXD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:6L52CGOKQJSLLYTRRIFBGDYDXD","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":"959c5165b4b000874ff4c454d16e8012a79d92eae94fa929422802c33ac13476","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2013-02-01T07:51:58Z","title_canon_sha256":"2bf9fca7434d962e74065d9961d232a4809e5dd2387d69c666c74b27c8e5d33a"},"schema_version":"1.0","source":{"id":"1302.0103","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.0103","created_at":"2026-05-18T03:33:13Z"},{"alias_kind":"arxiv_version","alias_value":"1302.0103v2","created_at":"2026-05-18T03:33:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.0103","created_at":"2026-05-18T03:33:13Z"},{"alias_kind":"pith_short_12","alias_value":"6L52CGOKQJSL","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_16","alias_value":"6L52CGOKQJSLLYTR","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_8","alias_value":"6L52CGOK","created_at":"2026-05-18T12:27:36Z"}],"graph_snapshots":[{"event_id":"sha256:da2b867d38818cdbe41aadfa2b8257cbbf20233e52ac1770a52c9f0630a723d6","target":"graph","created_at":"2026-05-18T03:33:13Z","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":"Since scientific investigation is one of the most important providers of massive amounts of ordered data, there is a renewed interest in array data processing in the context of Big Data. To the best of our knowledge, a unified resource that summarizes and analyzes array processing research over its long existence is currently missing. In this survey, we provide a guide for past, present, and future research in array processing. The survey is organized along three main topics. Array storage discusses all the aspects related to array partitioning into chunks. The identification of a reduced set ","authors_text":"Florin Rusu, Yu Cheng","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2013-02-01T07:51:58Z","title":"A Survey on Array Storage, Query Languages, and Systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.0103","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:b43c1d6126947834d3161bb168a511f42ca5f504550607b0b3604418e24a4623","target":"record","created_at":"2026-05-18T03:33:13Z","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":"959c5165b4b000874ff4c454d16e8012a79d92eae94fa929422802c33ac13476","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2013-02-01T07:51:58Z","title_canon_sha256":"2bf9fca7434d962e74065d9961d232a4809e5dd2387d69c666c74b27c8e5d33a"},"schema_version":"1.0","source":{"id":"1302.0103","kind":"arxiv","version":2}},"canonical_sha256":"f2fba119ca8264b5e2718a0a130f03b8d10c07de2a40f88e63b5e5cb5b4a1750","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f2fba119ca8264b5e2718a0a130f03b8d10c07de2a40f88e63b5e5cb5b4a1750","first_computed_at":"2026-05-18T03:33:13.427556Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:33:13.427556Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/g0aO5qW3bKEfPJMDUqguN/RGHvLLgC+bozWNX5vafYvNUo0m6bBodFNuHvGYHYNpKVQ9ISZSzFqmW2rbBQSCA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:33:13.428624Z","signed_message":"canonical_sha256_bytes"},"source_id":"1302.0103","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b43c1d6126947834d3161bb168a511f42ca5f504550607b0b3604418e24a4623","sha256:da2b867d38818cdbe41aadfa2b8257cbbf20233e52ac1770a52c9f0630a723d6"],"state_sha256":"7b9620928372c6bb65c92415a068924227edabe0f94c5b0a63b8558edb908501"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JgwyXTBHgIymQcjo9mAYmD6fn4wwwysN6MCQ7Q05gj+kus1Uy1oMlOIaP7TZJb0fta4AwfSfFOR09H/FMgk7Dg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T17:21:52.628380Z","bundle_sha256":"19288e0da87c87b2003bb7c86b7cdf3f04fa041a43579aac203565063a65d4ff"}}