{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:BJACN6TRZDP4PA4EQSEOYIFUWM","short_pith_number":"pith:BJACN6TR","canonical_record":{"source":{"id":"2412.16323","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2024-12-20T20:22:11Z","cross_cats_sorted":[],"title_canon_sha256":"888a18dd1a835fd471325898c3ce9a22f989f7c7139b620c0777cd66e814332e","abstract_canon_sha256":"31cd2bbe71df47abcb7b3922a2509359a09332a6615b67f5b8827d9447d4269b"},"schema_version":"1.0"},"canonical_sha256":"0a4026fa71c8dfc783848488ec20b4b30feb7c9eed8412ae21c5bd15f21ae93a","source":{"kind":"arxiv","id":"2412.16323","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2412.16323","created_at":"2026-07-05T11:04:43Z"},{"alias_kind":"arxiv_version","alias_value":"2412.16323v3","created_at":"2026-07-05T11:04:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.16323","created_at":"2026-07-05T11:04:43Z"},{"alias_kind":"pith_short_12","alias_value":"BJACN6TRZDP4","created_at":"2026-07-05T11:04:43Z"},{"alias_kind":"pith_short_16","alias_value":"BJACN6TRZDP4PA4E","created_at":"2026-07-05T11:04:43Z"},{"alias_kind":"pith_short_8","alias_value":"BJACN6TR","created_at":"2026-07-05T11:04:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:BJACN6TRZDP4PA4EQSEOYIFUWM","target":"record","payload":{"canonical_record":{"source":{"id":"2412.16323","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2024-12-20T20:22:11Z","cross_cats_sorted":[],"title_canon_sha256":"888a18dd1a835fd471325898c3ce9a22f989f7c7139b620c0777cd66e814332e","abstract_canon_sha256":"31cd2bbe71df47abcb7b3922a2509359a09332a6615b67f5b8827d9447d4269b"},"schema_version":"1.0"},"canonical_sha256":"0a4026fa71c8dfc783848488ec20b4b30feb7c9eed8412ae21c5bd15f21ae93a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:04:43.216155Z","signature_b64":"zK4CLQtgatcRDz9OSCIho0P+/l2vJtI23BLevrfIBPxpAMtNpDUp7O6/0qvyOCxLpgraD/YK4z/P3csW/oEdDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0a4026fa71c8dfc783848488ec20b4b30feb7c9eed8412ae21c5bd15f21ae93a","last_reissued_at":"2026-07-05T11:04:43.215646Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:04:43.215646Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2412.16323","source_version":3,"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-07-05T11:04:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DxEke7bay3LvXVVggqwsmcjv0Le/x1IhBzty4u0WmzSg8f0vAElzMGeDDL7aTaL/tMSpzTeulZtTxdM55d/LCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T17:44:02.757551Z"},"content_sha256":"64e176583cb2d94fa5c7d47e1cd9670bd4ddb95dd1434f3bbba371ff0c66e36e","schema_version":"1.0","event_id":"sha256:64e176583cb2d94fa5c7d47e1cd9670bd4ddb95dd1434f3bbba371ff0c66e36e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:BJACN6TRZDP4PA4EQSEOYIFUWM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimizing Queries with Many-to-Many Joins","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Amol Deshpande, Hasara Kalumin","submitted_at":"2024-12-20T20:22:11Z","abstract_excerpt":"As database query processing techniques are being used to handle diverse workloads, a key emerging challenge is how to efficiently handle multi-way join queries containing multiple many-to-many joins. While uncommon in traditional enterprise settings that have been the focus of much of the query optimization work to date, such queries are seen frequently in other contexts such as graph workloads. This has led to much work on developing join algorithms for handling cyclic queries, on compressed (factorized) representations for more efficient storage of intermediate results, and on use of semi-j"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.16323","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2412.16323/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T11:04:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TwPVQzkoLpCxOHMKllUmAPgSxxwnoxzpeSEpjL50rxgwvv7v19iBViz8jVS4Y+updN9oFX7bCwzlyIJBKnp3BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T17:44:02.758188Z"},"content_sha256":"f08e802b1ec70460c6850ba5335bf0be9dab852b5f583612b4438968011633c2","schema_version":"1.0","event_id":"sha256:f08e802b1ec70460c6850ba5335bf0be9dab852b5f583612b4438968011633c2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BJACN6TRZDP4PA4EQSEOYIFUWM/bundle.json","state_url":"https://pith.science/pith/BJACN6TRZDP4PA4EQSEOYIFUWM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BJACN6TRZDP4PA4EQSEOYIFUWM/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-08-11T17:44:02Z","links":{"resolver":"https://pith.science/pith/BJACN6TRZDP4PA4EQSEOYIFUWM","bundle":"https://pith.science/pith/BJACN6TRZDP4PA4EQSEOYIFUWM/bundle.json","state":"https://pith.science/pith/BJACN6TRZDP4PA4EQSEOYIFUWM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BJACN6TRZDP4PA4EQSEOYIFUWM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:BJACN6TRZDP4PA4EQSEOYIFUWM","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":"31cd2bbe71df47abcb7b3922a2509359a09332a6615b67f5b8827d9447d4269b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2024-12-20T20:22:11Z","title_canon_sha256":"888a18dd1a835fd471325898c3ce9a22f989f7c7139b620c0777cd66e814332e"},"schema_version":"1.0","source":{"id":"2412.16323","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2412.16323","created_at":"2026-07-05T11:04:43Z"},{"alias_kind":"arxiv_version","alias_value":"2412.16323v3","created_at":"2026-07-05T11:04:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.16323","created_at":"2026-07-05T11:04:43Z"},{"alias_kind":"pith_short_12","alias_value":"BJACN6TRZDP4","created_at":"2026-07-05T11:04:43Z"},{"alias_kind":"pith_short_16","alias_value":"BJACN6TRZDP4PA4E","created_at":"2026-07-05T11:04:43Z"},{"alias_kind":"pith_short_8","alias_value":"BJACN6TR","created_at":"2026-07-05T11:04:43Z"}],"graph_snapshots":[{"event_id":"sha256:f08e802b1ec70460c6850ba5335bf0be9dab852b5f583612b4438968011633c2","target":"graph","created_at":"2026-07-05T11:04:43Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2412.16323/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"As database query processing techniques are being used to handle diverse workloads, a key emerging challenge is how to efficiently handle multi-way join queries containing multiple many-to-many joins. While uncommon in traditional enterprise settings that have been the focus of much of the query optimization work to date, such queries are seen frequently in other contexts such as graph workloads. This has led to much work on developing join algorithms for handling cyclic queries, on compressed (factorized) representations for more efficient storage of intermediate results, and on use of semi-j","authors_text":"Amol Deshpande, Hasara Kalumin","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2024-12-20T20:22:11Z","title":"Optimizing Queries with Many-to-Many Joins"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.16323","kind":"arxiv","version":3},"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:64e176583cb2d94fa5c7d47e1cd9670bd4ddb95dd1434f3bbba371ff0c66e36e","target":"record","created_at":"2026-07-05T11:04:43Z","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":"31cd2bbe71df47abcb7b3922a2509359a09332a6615b67f5b8827d9447d4269b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2024-12-20T20:22:11Z","title_canon_sha256":"888a18dd1a835fd471325898c3ce9a22f989f7c7139b620c0777cd66e814332e"},"schema_version":"1.0","source":{"id":"2412.16323","kind":"arxiv","version":3}},"canonical_sha256":"0a4026fa71c8dfc783848488ec20b4b30feb7c9eed8412ae21c5bd15f21ae93a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0a4026fa71c8dfc783848488ec20b4b30feb7c9eed8412ae21c5bd15f21ae93a","first_computed_at":"2026-07-05T11:04:43.215646Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:04:43.215646Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zK4CLQtgatcRDz9OSCIho0P+/l2vJtI23BLevrfIBPxpAMtNpDUp7O6/0qvyOCxLpgraD/YK4z/P3csW/oEdDg==","signature_status":"signed_v1","signed_at":"2026-07-05T11:04:43.216155Z","signed_message":"canonical_sha256_bytes"},"source_id":"2412.16323","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:64e176583cb2d94fa5c7d47e1cd9670bd4ddb95dd1434f3bbba371ff0c66e36e","sha256:f08e802b1ec70460c6850ba5335bf0be9dab852b5f583612b4438968011633c2"],"state_sha256":"c62736db4833457ce75f4b87b0c6133909326c6bd8ae860ee58a806164ca1d39"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pgQMBVae3oBzPE/+K3Vl5pP4UkCBcyforp511I9n4qH7zCNmQd2+cA1/uInTRXsOkqUX99zFtOMcaE6vyzG4DQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-11T17:44:02.765974Z","bundle_sha256":"1bb5f1a079938a4e577733a55f19ca4593be25f3de2b404dd36d59a0a42df5ae"}}