{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:FVQN6NCQHMTJUSA2LTC23WCMKZ","short_pith_number":"pith:FVQN6NCQ","canonical_record":{"source":{"id":"2406.05536","kind":"arxiv","version":5},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.DB","submitted_at":"2024-06-08T17:35:14Z","cross_cats_sorted":[],"title_canon_sha256":"29b45d6c95cd955d505bd737d677e1a08697c042b475090551b20e0a013c2c93","abstract_canon_sha256":"618b368490786866f9f11ea14610e1317b387869d3b572619812fb5441f454ab"},"schema_version":"1.0"},"canonical_sha256":"2d60df34503b269a481a5cc5add84c566ba594cff9e783de74406b77c226a815","source":{"kind":"arxiv","id":"2406.05536","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2406.05536","created_at":"2026-07-05T10:29:17Z"},{"alias_kind":"arxiv_version","alias_value":"2406.05536v5","created_at":"2026-07-05T10:29:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2406.05536","created_at":"2026-07-05T10:29:17Z"},{"alias_kind":"pith_short_12","alias_value":"FVQN6NCQHMTJ","created_at":"2026-07-05T10:29:17Z"},{"alias_kind":"pith_short_16","alias_value":"FVQN6NCQHMTJUSA2","created_at":"2026-07-05T10:29:17Z"},{"alias_kind":"pith_short_8","alias_value":"FVQN6NCQ","created_at":"2026-07-05T10:29:17Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:FVQN6NCQHMTJUSA2LTC23WCMKZ","target":"record","payload":{"canonical_record":{"source":{"id":"2406.05536","kind":"arxiv","version":5},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.DB","submitted_at":"2024-06-08T17:35:14Z","cross_cats_sorted":[],"title_canon_sha256":"29b45d6c95cd955d505bd737d677e1a08697c042b475090551b20e0a013c2c93","abstract_canon_sha256":"618b368490786866f9f11ea14610e1317b387869d3b572619812fb5441f454ab"},"schema_version":"1.0"},"canonical_sha256":"2d60df34503b269a481a5cc5add84c566ba594cff9e783de74406b77c226a815","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:29:17.966935Z","signature_b64":"NFxPenoOFE7ERVJMKDmiZNAPnQHnKJIe7hPJ14CuzxKhSJAjEqxoPgvuJA90aSB31tlSnbBwZGMCvTQ5sVuaCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2d60df34503b269a481a5cc5add84c566ba594cff9e783de74406b77c226a815","last_reissued_at":"2026-07-05T10:29:17.966013Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:29:17.966013Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2406.05536","source_version":5,"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-05T10:29:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"25Fa8XRH6vnb49fjYfEE2n8/FRqZeKOO1xlQgSTrVWp7le3CE6VIrAgKIwvQqNHohHHxHSuzFj9i52Hpn66vBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-19T10:10:28.431035Z"},"content_sha256":"22e57f2e967064685f5d17a72fe698f603a1991d32b2b3f64ec080ef183fee07","schema_version":"1.0","event_id":"sha256:22e57f2e967064685f5d17a72fe698f603a1991d32b2b3f64ec080ef183fee07"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:FVQN6NCQHMTJUSA2LTC23WCMKZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Output-Optimal Algorithms for Join-Aggregate Queries","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Xiao Hu","submitted_at":"2024-06-08T17:35:14Z","abstract_excerpt":"One of the most celebrated results of computing join-aggregate queries defined over commutative semi-rings is the classic Yannakakis algorithm proposed in 1981. It is known that the runtime of the Yannakakis algorithm is $O(N + \\OUT)$ for any free-connex query, where $N$ is the input size of the database and $\\OUT$ is the output size of the query result. This is already output-optimal. However, only an upper bound $O(N \\cdot \\OUT)$ on the runtime is known for the large remaining class of acyclic but non-free-connex queries. Alternatively, one can convert a non-free-connex query into a free-con"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2406.05536","kind":"arxiv","version":5},"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/2406.05536/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-05T10:29:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"K2jHEVn25XnWYNYtCbi1wcK1jcHzU/yJEXiYLFIgJJTeijO64dSSytKFm/u1NZkWd3YZu+XHyFH5eC3atd/DCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-19T10:10:28.431537Z"},"content_sha256":"ee71b8f09351ec0b607c755f93f1b1083173767d46f496685774ed1fface00c5","schema_version":"1.0","event_id":"sha256:ee71b8f09351ec0b607c755f93f1b1083173767d46f496685774ed1fface00c5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FVQN6NCQHMTJUSA2LTC23WCMKZ/bundle.json","state_url":"https://pith.science/pith/FVQN6NCQHMTJUSA2LTC23WCMKZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FVQN6NCQHMTJUSA2LTC23WCMKZ/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-19T10:10:28Z","links":{"resolver":"https://pith.science/pith/FVQN6NCQHMTJUSA2LTC23WCMKZ","bundle":"https://pith.science/pith/FVQN6NCQHMTJUSA2LTC23WCMKZ/bundle.json","state":"https://pith.science/pith/FVQN6NCQHMTJUSA2LTC23WCMKZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FVQN6NCQHMTJUSA2LTC23WCMKZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:FVQN6NCQHMTJUSA2LTC23WCMKZ","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":"618b368490786866f9f11ea14610e1317b387869d3b572619812fb5441f454ab","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.DB","submitted_at":"2024-06-08T17:35:14Z","title_canon_sha256":"29b45d6c95cd955d505bd737d677e1a08697c042b475090551b20e0a013c2c93"},"schema_version":"1.0","source":{"id":"2406.05536","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2406.05536","created_at":"2026-07-05T10:29:17Z"},{"alias_kind":"arxiv_version","alias_value":"2406.05536v5","created_at":"2026-07-05T10:29:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2406.05536","created_at":"2026-07-05T10:29:17Z"},{"alias_kind":"pith_short_12","alias_value":"FVQN6NCQHMTJ","created_at":"2026-07-05T10:29:17Z"},{"alias_kind":"pith_short_16","alias_value":"FVQN6NCQHMTJUSA2","created_at":"2026-07-05T10:29:17Z"},{"alias_kind":"pith_short_8","alias_value":"FVQN6NCQ","created_at":"2026-07-05T10:29:17Z"}],"graph_snapshots":[{"event_id":"sha256:ee71b8f09351ec0b607c755f93f1b1083173767d46f496685774ed1fface00c5","target":"graph","created_at":"2026-07-05T10:29:17Z","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/2406.05536/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"One of the most celebrated results of computing join-aggregate queries defined over commutative semi-rings is the classic Yannakakis algorithm proposed in 1981. It is known that the runtime of the Yannakakis algorithm is $O(N + \\OUT)$ for any free-connex query, where $N$ is the input size of the database and $\\OUT$ is the output size of the query result. This is already output-optimal. However, only an upper bound $O(N \\cdot \\OUT)$ on the runtime is known for the large remaining class of acyclic but non-free-connex queries. Alternatively, one can convert a non-free-connex query into a free-con","authors_text":"Xiao Hu","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.DB","submitted_at":"2024-06-08T17:35:14Z","title":"Output-Optimal Algorithms for Join-Aggregate Queries"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2406.05536","kind":"arxiv","version":5},"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:22e57f2e967064685f5d17a72fe698f603a1991d32b2b3f64ec080ef183fee07","target":"record","created_at":"2026-07-05T10:29:17Z","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":"618b368490786866f9f11ea14610e1317b387869d3b572619812fb5441f454ab","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.DB","submitted_at":"2024-06-08T17:35:14Z","title_canon_sha256":"29b45d6c95cd955d505bd737d677e1a08697c042b475090551b20e0a013c2c93"},"schema_version":"1.0","source":{"id":"2406.05536","kind":"arxiv","version":5}},"canonical_sha256":"2d60df34503b269a481a5cc5add84c566ba594cff9e783de74406b77c226a815","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2d60df34503b269a481a5cc5add84c566ba594cff9e783de74406b77c226a815","first_computed_at":"2026-07-05T10:29:17.966013Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:29:17.966013Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"NFxPenoOFE7ERVJMKDmiZNAPnQHnKJIe7hPJ14CuzxKhSJAjEqxoPgvuJA90aSB31tlSnbBwZGMCvTQ5sVuaCw==","signature_status":"signed_v1","signed_at":"2026-07-05T10:29:17.966935Z","signed_message":"canonical_sha256_bytes"},"source_id":"2406.05536","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:22e57f2e967064685f5d17a72fe698f603a1991d32b2b3f64ec080ef183fee07","sha256:ee71b8f09351ec0b607c755f93f1b1083173767d46f496685774ed1fface00c5"],"state_sha256":"f9e8aa470b5479fabc510f71bf46129220669c2fb94c3b97ada367600ad1cc09"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6BGtBGogAdNAkgkKhERime3HOiGZS3rWQo2a8gOtXHfoXhXaygpzSwFGfs4UDUmC3SviLhE4IROZm7hBz8dCDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-19T10:10:28.436428Z","bundle_sha256":"58aeeed6b6b9fba0b1135b9b90d7d1bbc0d12179f5f73d2195734995b3dbae5d"}}