{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:OCME7MPQ4R4RIUYEITARENVIYC","short_pith_number":"pith:OCME7MPQ","canonical_record":{"source":{"id":"1210.6284","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2012-10-23T16:32:13Z","cross_cats_sorted":["cs.DB"],"title_canon_sha256":"1143e9996a3376f5c517152c4bd4e3af68caae68c2792cf801fd07a6bca6bd67","abstract_canon_sha256":"67e581ad324a1661fd3bed83d21b52f9c8d915b6102d135082278de90078422e"},"schema_version":"1.0"},"canonical_sha256":"70984fb1f0e47914530444c11236a8c0bdb37c37e0898d3794c18c1c920d8652","source":{"kind":"arxiv","id":"1210.6284","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.6284","created_at":"2026-05-18T03:05:54Z"},{"alias_kind":"arxiv_version","alias_value":"1210.6284v1","created_at":"2026-05-18T03:05:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.6284","created_at":"2026-05-18T03:05:54Z"},{"alias_kind":"pith_short_12","alias_value":"OCME7MPQ4R4R","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_16","alias_value":"OCME7MPQ4R4RIUYE","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_8","alias_value":"OCME7MPQ","created_at":"2026-05-18T12:27:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:OCME7MPQ4R4RIUYEITARENVIYC","target":"record","payload":{"canonical_record":{"source":{"id":"1210.6284","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2012-10-23T16:32:13Z","cross_cats_sorted":["cs.DB"],"title_canon_sha256":"1143e9996a3376f5c517152c4bd4e3af68caae68c2792cf801fd07a6bca6bd67","abstract_canon_sha256":"67e581ad324a1661fd3bed83d21b52f9c8d915b6102d135082278de90078422e"},"schema_version":"1.0"},"canonical_sha256":"70984fb1f0e47914530444c11236a8c0bdb37c37e0898d3794c18c1c920d8652","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:05:54.960338Z","signature_b64":"ftqspbJXuu8XJnjd+VVMj4KKWzG/FtGf+iZZUmz6B6zxeDt/8pHgUB36CrOlajKyZ67ESl5cXeUH94jQ+YE8Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"70984fb1f0e47914530444c11236a8c0bdb37c37e0898d3794c18c1c920d8652","last_reissued_at":"2026-05-18T03:05:54.959832Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:05:54.959832Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1210.6284","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:05:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WPfMjGsNKoxXb22/dJmfJJH+ou7vwWm+McNosPOys2FcuCR+AAjjE2Pp00gSW4GiH6IPYofsXIjteqHVQVMVAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T03:55:06.613181Z"},"content_sha256":"3d38a1b2e8a1bc1893107aa98f22715e29ed3c12347f28319a3d08dd5c6e2930","schema_version":"1.0","event_id":"sha256:3d38a1b2e8a1bc1893107aa98f22715e29ed3c12347f28319a3d08dd5c6e2930"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:OCME7MPQ4R4RIUYEITARENVIYC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Reify Your Collection Queries for Modularity and Speed!","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DB"],"primary_cat":"cs.PL","authors_text":"Christian K\\\"astner, Klaus Ostermann, Michael Eichberg, Paolo G. Giarrusso, Ralf Mitschke, Tillmann Rendel","submitted_at":"2012-10-23T16:32:13Z","abstract_excerpt":"Modularity and efficiency are often contradicting requirements, such that programers have to trade one for the other. We analyze this dilemma in the context of programs operating on collections. Performance-critical code using collections need often to be hand-optimized, leading to non-modular, brittle, and redundant code. In principle, this dilemma could be avoided by automatic collection-specific optimizations, such as fusion of collection traversals, usage of indexing, or reordering of filters. Unfortunately, it is not obvious how to encode such optimizations in terms of ordinary collection"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.6284","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:05:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xTpDC/1T5Nlz2y4ePWcZ1FHdrgWtvNcQoj4weYgcmqza4ujrzgGLoqMl78+v4bxVJJ/f3Z4uBW4CAvLMGs6qDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T03:55:06.613846Z"},"content_sha256":"89321ea770258512e3f0d6cd55f75dc7ffb29cfc0f2a963fa5ff78d5a25b3673","schema_version":"1.0","event_id":"sha256:89321ea770258512e3f0d6cd55f75dc7ffb29cfc0f2a963fa5ff78d5a25b3673"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OCME7MPQ4R4RIUYEITARENVIYC/bundle.json","state_url":"https://pith.science/pith/OCME7MPQ4R4RIUYEITARENVIYC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OCME7MPQ4R4RIUYEITARENVIYC/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-30T03:55:06Z","links":{"resolver":"https://pith.science/pith/OCME7MPQ4R4RIUYEITARENVIYC","bundle":"https://pith.science/pith/OCME7MPQ4R4RIUYEITARENVIYC/bundle.json","state":"https://pith.science/pith/OCME7MPQ4R4RIUYEITARENVIYC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OCME7MPQ4R4RIUYEITARENVIYC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:OCME7MPQ4R4RIUYEITARENVIYC","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":"67e581ad324a1661fd3bed83d21b52f9c8d915b6102d135082278de90078422e","cross_cats_sorted":["cs.DB"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2012-10-23T16:32:13Z","title_canon_sha256":"1143e9996a3376f5c517152c4bd4e3af68caae68c2792cf801fd07a6bca6bd67"},"schema_version":"1.0","source":{"id":"1210.6284","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.6284","created_at":"2026-05-18T03:05:54Z"},{"alias_kind":"arxiv_version","alias_value":"1210.6284v1","created_at":"2026-05-18T03:05:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.6284","created_at":"2026-05-18T03:05:54Z"},{"alias_kind":"pith_short_12","alias_value":"OCME7MPQ4R4R","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_16","alias_value":"OCME7MPQ4R4RIUYE","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_8","alias_value":"OCME7MPQ","created_at":"2026-05-18T12:27:16Z"}],"graph_snapshots":[{"event_id":"sha256:89321ea770258512e3f0d6cd55f75dc7ffb29cfc0f2a963fa5ff78d5a25b3673","target":"graph","created_at":"2026-05-18T03:05:54Z","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":"Modularity and efficiency are often contradicting requirements, such that programers have to trade one for the other. We analyze this dilemma in the context of programs operating on collections. Performance-critical code using collections need often to be hand-optimized, leading to non-modular, brittle, and redundant code. In principle, this dilemma could be avoided by automatic collection-specific optimizations, such as fusion of collection traversals, usage of indexing, or reordering of filters. Unfortunately, it is not obvious how to encode such optimizations in terms of ordinary collection","authors_text":"Christian K\\\"astner, Klaus Ostermann, Michael Eichberg, Paolo G. Giarrusso, Ralf Mitschke, Tillmann Rendel","cross_cats":["cs.DB"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2012-10-23T16:32:13Z","title":"Reify Your Collection Queries for Modularity and Speed!"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.6284","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:3d38a1b2e8a1bc1893107aa98f22715e29ed3c12347f28319a3d08dd5c6e2930","target":"record","created_at":"2026-05-18T03:05:54Z","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":"67e581ad324a1661fd3bed83d21b52f9c8d915b6102d135082278de90078422e","cross_cats_sorted":["cs.DB"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2012-10-23T16:32:13Z","title_canon_sha256":"1143e9996a3376f5c517152c4bd4e3af68caae68c2792cf801fd07a6bca6bd67"},"schema_version":"1.0","source":{"id":"1210.6284","kind":"arxiv","version":1}},"canonical_sha256":"70984fb1f0e47914530444c11236a8c0bdb37c37e0898d3794c18c1c920d8652","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"70984fb1f0e47914530444c11236a8c0bdb37c37e0898d3794c18c1c920d8652","first_computed_at":"2026-05-18T03:05:54.959832Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:05:54.959832Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ftqspbJXuu8XJnjd+VVMj4KKWzG/FtGf+iZZUmz6B6zxeDt/8pHgUB36CrOlajKyZ67ESl5cXeUH94jQ+YE8Cg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:05:54.960338Z","signed_message":"canonical_sha256_bytes"},"source_id":"1210.6284","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3d38a1b2e8a1bc1893107aa98f22715e29ed3c12347f28319a3d08dd5c6e2930","sha256:89321ea770258512e3f0d6cd55f75dc7ffb29cfc0f2a963fa5ff78d5a25b3673"],"state_sha256":"be4015963acb5c8c3e90330ea9de0761e8aa48d03a4454633e6405d4d2f91ac3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"D6HDWPGIz68egNemSbQXqlC4x42u2w8EFHQUQ4KFcA3afAC1C6234YMA9sS3Qv2wg8Gd7KM7EfCzVw3ErdFnAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T03:55:06.617115Z","bundle_sha256":"9fe9ec764dc8405fabf54b1602253b707765a622232a50f4f6d02da41795f091"}}