{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:A6UF7K3CFBRFPFUCCKUJMKSJVP","short_pith_number":"pith:A6UF7K3C","canonical_record":{"source":{"id":"1311.6335","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2013-11-25T15:26:49Z","cross_cats_sorted":[],"title_canon_sha256":"b526ef1b81d64ddb80968ac1212f00dc10bafb3f139cbc2d4f930e54f9bfa072","abstract_canon_sha256":"375781e1e9d6f98cabffe9e25260f3dd91600fe76751f7febe72a7f00a03c9ac"},"schema_version":"1.0"},"canonical_sha256":"07a85fab62286257968212a8962a49abe468f25912366f2966f3be972e9285eb","source":{"kind":"arxiv","id":"1311.6335","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1311.6335","created_at":"2026-05-18T03:06:14Z"},{"alias_kind":"arxiv_version","alias_value":"1311.6335v1","created_at":"2026-05-18T03:06:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.6335","created_at":"2026-05-18T03:06:14Z"},{"alias_kind":"pith_short_12","alias_value":"A6UF7K3CFBRF","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_16","alias_value":"A6UF7K3CFBRFPFUC","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_8","alias_value":"A6UF7K3C","created_at":"2026-05-18T12:27:38Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:A6UF7K3CFBRFPFUCCKUJMKSJVP","target":"record","payload":{"canonical_record":{"source":{"id":"1311.6335","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2013-11-25T15:26:49Z","cross_cats_sorted":[],"title_canon_sha256":"b526ef1b81d64ddb80968ac1212f00dc10bafb3f139cbc2d4f930e54f9bfa072","abstract_canon_sha256":"375781e1e9d6f98cabffe9e25260f3dd91600fe76751f7febe72a7f00a03c9ac"},"schema_version":"1.0"},"canonical_sha256":"07a85fab62286257968212a8962a49abe468f25912366f2966f3be972e9285eb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:06:14.336719Z","signature_b64":"ibKbGcvICXm9vQg3O5zK8ljaixLX3QTwA8jGyGCGj/c4Tlt+AnHjB/+xMJEHHOd8pzII8TPmi70YXVj/2LwuAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"07a85fab62286257968212a8962a49abe468f25912366f2966f3be972e9285eb","last_reissued_at":"2026-05-18T03:06:14.336221Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:06:14.336221Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1311.6335","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:06:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xW8nMkPNfML/Wq/mAQmTOcdL7WaNjYqsHT0P5h7l1Pm8d9qY6dnmb3wV/GWFAa2wjHJUFlanfXu/VkwvJ7ZYBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T05:16:32.353382Z"},"content_sha256":"b00328e0b296a33fb529d678d26e417eac20c0ade4bc95e40f8cd99d5f792996","schema_version":"1.0","event_id":"sha256:b00328e0b296a33fb529d678d26e417eac20c0ade4bc95e40f8cd99d5f792996"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:A6UF7K3CFBRFPFUCCKUJMKSJVP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"SOFA: An Extensible Logical Optimizer for UDF-heavy Dataflows","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Arvid Heise, Astrid Rheinl\\\"ander, Fabian Hueske, Felix Naumann, Ulf Leser","submitted_at":"2013-11-25T15:26:49Z","abstract_excerpt":"Recent years have seen an increased interest in large-scale analytical dataflows on non-relational data. These dataflows are compiled into execution graphs scheduled on large compute clusters. In many novel application areas the predominant building blocks of such dataflows are user-defined predicates or functions (UDFs). However, the heavy use of UDFs is not well taken into account for dataflow optimization in current systems.\n  SOFA is a novel and extensible optimizer for UDF-heavy dataflows. It builds on a concise set of properties for describing the semantics of Map/Reduce-style UDFs and a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.6335","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:06:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RXi/x/ZDELZXJGfOuIrf314rGiyaJU8G7O3/aJh0pKBA87UbIBriY8p9+XDZniWMPiS7uxIuicVvWhxQLiNECw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T05:16:32.354048Z"},"content_sha256":"bb7c87779500562da62b77f635ddca3851254f775713d1b6ca62f2f07bac236c","schema_version":"1.0","event_id":"sha256:bb7c87779500562da62b77f635ddca3851254f775713d1b6ca62f2f07bac236c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/A6UF7K3CFBRFPFUCCKUJMKSJVP/bundle.json","state_url":"https://pith.science/pith/A6UF7K3CFBRFPFUCCKUJMKSJVP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/A6UF7K3CFBRFPFUCCKUJMKSJVP/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-06-11T05:16:32Z","links":{"resolver":"https://pith.science/pith/A6UF7K3CFBRFPFUCCKUJMKSJVP","bundle":"https://pith.science/pith/A6UF7K3CFBRFPFUCCKUJMKSJVP/bundle.json","state":"https://pith.science/pith/A6UF7K3CFBRFPFUCCKUJMKSJVP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/A6UF7K3CFBRFPFUCCKUJMKSJVP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:A6UF7K3CFBRFPFUCCKUJMKSJVP","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":"375781e1e9d6f98cabffe9e25260f3dd91600fe76751f7febe72a7f00a03c9ac","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2013-11-25T15:26:49Z","title_canon_sha256":"b526ef1b81d64ddb80968ac1212f00dc10bafb3f139cbc2d4f930e54f9bfa072"},"schema_version":"1.0","source":{"id":"1311.6335","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1311.6335","created_at":"2026-05-18T03:06:14Z"},{"alias_kind":"arxiv_version","alias_value":"1311.6335v1","created_at":"2026-05-18T03:06:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.6335","created_at":"2026-05-18T03:06:14Z"},{"alias_kind":"pith_short_12","alias_value":"A6UF7K3CFBRF","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_16","alias_value":"A6UF7K3CFBRFPFUC","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_8","alias_value":"A6UF7K3C","created_at":"2026-05-18T12:27:38Z"}],"graph_snapshots":[{"event_id":"sha256:bb7c87779500562da62b77f635ddca3851254f775713d1b6ca62f2f07bac236c","target":"graph","created_at":"2026-05-18T03:06:14Z","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":"Recent years have seen an increased interest in large-scale analytical dataflows on non-relational data. These dataflows are compiled into execution graphs scheduled on large compute clusters. In many novel application areas the predominant building blocks of such dataflows are user-defined predicates or functions (UDFs). However, the heavy use of UDFs is not well taken into account for dataflow optimization in current systems.\n  SOFA is a novel and extensible optimizer for UDF-heavy dataflows. It builds on a concise set of properties for describing the semantics of Map/Reduce-style UDFs and a","authors_text":"Arvid Heise, Astrid Rheinl\\\"ander, Fabian Hueske, Felix Naumann, Ulf Leser","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2013-11-25T15:26:49Z","title":"SOFA: An Extensible Logical Optimizer for UDF-heavy Dataflows"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.6335","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:b00328e0b296a33fb529d678d26e417eac20c0ade4bc95e40f8cd99d5f792996","target":"record","created_at":"2026-05-18T03:06:14Z","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":"375781e1e9d6f98cabffe9e25260f3dd91600fe76751f7febe72a7f00a03c9ac","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2013-11-25T15:26:49Z","title_canon_sha256":"b526ef1b81d64ddb80968ac1212f00dc10bafb3f139cbc2d4f930e54f9bfa072"},"schema_version":"1.0","source":{"id":"1311.6335","kind":"arxiv","version":1}},"canonical_sha256":"07a85fab62286257968212a8962a49abe468f25912366f2966f3be972e9285eb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"07a85fab62286257968212a8962a49abe468f25912366f2966f3be972e9285eb","first_computed_at":"2026-05-18T03:06:14.336221Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:06:14.336221Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ibKbGcvICXm9vQg3O5zK8ljaixLX3QTwA8jGyGCGj/c4Tlt+AnHjB/+xMJEHHOd8pzII8TPmi70YXVj/2LwuAg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:06:14.336719Z","signed_message":"canonical_sha256_bytes"},"source_id":"1311.6335","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b00328e0b296a33fb529d678d26e417eac20c0ade4bc95e40f8cd99d5f792996","sha256:bb7c87779500562da62b77f635ddca3851254f775713d1b6ca62f2f07bac236c"],"state_sha256":"414fdf2882c9f522fb3bf96f64e9916bf436854674fd77ad9a7ac7bfa3aa0b26"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kT+VIz3T4XTap6wcdh4Fske7mSP1wAzPT8hY88mbyAWEue3ledXOQVbg38rOf1B2iMdtFCv7ZEvr6U+si5sGBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T05:16:32.357479Z","bundle_sha256":"d7f9d5b73afe96a17b68650eadd56ceef8d7a5249b6977e3756544ede641aa25"}}