{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:FVQN6NCQHMTJUSA2LTC23WCMKZ","short_pith_number":"pith:FVQN6NCQ","schema_version":"1.0","canonical_sha256":"2d60df34503b269a481a5cc5add84c566ba594cff9e783de74406b77c226a815","source":{"kind":"arxiv","id":"2406.05536","version":5},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2406.05536","created_at":"2026-07-05T10:29:17.966128+00:00"},{"alias_kind":"arxiv_version","alias_value":"2406.05536v5","created_at":"2026-07-05T10:29:17.966128+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2406.05536","created_at":"2026-07-05T10:29:17.966128+00:00"},{"alias_kind":"pith_short_12","alias_value":"FVQN6NCQHMTJ","created_at":"2026-07-05T10:29:17.966128+00:00"},{"alias_kind":"pith_short_16","alias_value":"FVQN6NCQHMTJUSA2","created_at":"2026-07-05T10:29:17.966128+00:00"},{"alias_kind":"pith_short_8","alias_value":"FVQN6NCQ","created_at":"2026-07-05T10:29:17.966128+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2412.07729","citing_title":"Output-Sensitive Evaluation of Regular Path Queries","ref_index":45,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/FVQN6NCQHMTJUSA2LTC23WCMKZ","json":"https://pith.science/pith/FVQN6NCQHMTJUSA2LTC23WCMKZ.json","graph_json":"https://pith.science/api/pith-number/FVQN6NCQHMTJUSA2LTC23WCMKZ/graph.json","events_json":"https://pith.science/api/pith-number/FVQN6NCQHMTJUSA2LTC23WCMKZ/events.json","paper":"https://pith.science/paper/FVQN6NCQ"},"agent_actions":{"view_html":"https://pith.science/pith/FVQN6NCQHMTJUSA2LTC23WCMKZ","download_json":"https://pith.science/pith/FVQN6NCQHMTJUSA2LTC23WCMKZ.json","view_paper":"https://pith.science/paper/FVQN6NCQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2406.05536&json=true","fetch_graph":"https://pith.science/api/pith-number/FVQN6NCQHMTJUSA2LTC23WCMKZ/graph.json","fetch_events":"https://pith.science/api/pith-number/FVQN6NCQHMTJUSA2LTC23WCMKZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FVQN6NCQHMTJUSA2LTC23WCMKZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FVQN6NCQHMTJUSA2LTC23WCMKZ/action/storage_attestation","attest_author":"https://pith.science/pith/FVQN6NCQHMTJUSA2LTC23WCMKZ/action/author_attestation","sign_citation":"https://pith.science/pith/FVQN6NCQHMTJUSA2LTC23WCMKZ/action/citation_signature","submit_replication":"https://pith.science/pith/FVQN6NCQHMTJUSA2LTC23WCMKZ/action/replication_record"}},"created_at":"2026-07-05T10:29:17.966128+00:00","updated_at":"2026-07-05T10:29:17.966128+00:00"}