{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:P2YTH7EDTVVLHGD76IZ6HVTTB5","short_pith_number":"pith:P2YTH7ED","schema_version":"1.0","canonical_sha256":"7eb133fc839d6ab3987ff233e3d6730f6779029a897aebd556e8cae4d882a32b","source":{"kind":"arxiv","id":"1612.02384","version":1},"attestation_state":"computed","paper":{"title":"Subquadratic Algorithms for Algebraic Generalizations of 3SUM","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Aur\\'elien Ooms, Jean Cardinal, John Iacono, Luis Barba, Noam Solomon, Stefan Langerman","submitted_at":"2016-12-07T19:27:02Z","abstract_excerpt":"The 3SUM problem asks if an input $n$-set of real numbers contains a triple whose sum is zero. We consider the 3POL problem, a natural generalization of 3SUM where we replace the sum function by a constant-degree polynomial in three variables. The motivations are threefold. Raz, Sharir, and de Zeeuw gave a $O(n^{11/6})$ upper bound on the number of solutions of trivariate polynomial equations when the solutions are taken from the cartesian product of three $n$-sets of real numbers. We give algorithms for the corresponding problem of counting such solutions. Gr\\o nlund and Pettie recently desig"},"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":"1612.02384","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-12-07T19:27:02Z","cross_cats_sorted":[],"title_canon_sha256":"12db92ad31138f74ebc55af6d8861f8983b42d8a52238b6246e4361785985f42","abstract_canon_sha256":"5b85075c305927f6aaaade8c6422e4af330b1f1fdbcef54bac8334587921d178"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:55:34.804391Z","signature_b64":"VAKUoXw67Noc73+XYjF8Dt75Is2NEhocV5WMC4tLqDw+nIe+BtgH+ATAY9YA/lpwSAiDrc7p3lBMk1e9Kn35DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7eb133fc839d6ab3987ff233e3d6730f6779029a897aebd556e8cae4d882a32b","last_reissued_at":"2026-05-18T00:55:34.803888Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:55:34.803888Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Subquadratic Algorithms for Algebraic Generalizations of 3SUM","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Aur\\'elien Ooms, Jean Cardinal, John Iacono, Luis Barba, Noam Solomon, Stefan Langerman","submitted_at":"2016-12-07T19:27:02Z","abstract_excerpt":"The 3SUM problem asks if an input $n$-set of real numbers contains a triple whose sum is zero. We consider the 3POL problem, a natural generalization of 3SUM where we replace the sum function by a constant-degree polynomial in three variables. The motivations are threefold. Raz, Sharir, and de Zeeuw gave a $O(n^{11/6})$ upper bound on the number of solutions of trivariate polynomial equations when the solutions are taken from the cartesian product of three $n$-sets of real numbers. We give algorithms for the corresponding problem of counting such solutions. Gr\\o nlund and Pettie recently desig"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.02384","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1612.02384","created_at":"2026-05-18T00:55:34.803971+00:00"},{"alias_kind":"arxiv_version","alias_value":"1612.02384v1","created_at":"2026-05-18T00:55:34.803971+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.02384","created_at":"2026-05-18T00:55:34.803971+00:00"},{"alias_kind":"pith_short_12","alias_value":"P2YTH7EDTVVL","created_at":"2026-05-18T12:30:36.002864+00:00"},{"alias_kind":"pith_short_16","alias_value":"P2YTH7EDTVVLHGD7","created_at":"2026-05-18T12:30:36.002864+00:00"},{"alias_kind":"pith_short_8","alias_value":"P2YTH7ED","created_at":"2026-05-18T12:30:36.002864+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/P2YTH7EDTVVLHGD76IZ6HVTTB5","json":"https://pith.science/pith/P2YTH7EDTVVLHGD76IZ6HVTTB5.json","graph_json":"https://pith.science/api/pith-number/P2YTH7EDTVVLHGD76IZ6HVTTB5/graph.json","events_json":"https://pith.science/api/pith-number/P2YTH7EDTVVLHGD76IZ6HVTTB5/events.json","paper":"https://pith.science/paper/P2YTH7ED"},"agent_actions":{"view_html":"https://pith.science/pith/P2YTH7EDTVVLHGD76IZ6HVTTB5","download_json":"https://pith.science/pith/P2YTH7EDTVVLHGD76IZ6HVTTB5.json","view_paper":"https://pith.science/paper/P2YTH7ED","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1612.02384&json=true","fetch_graph":"https://pith.science/api/pith-number/P2YTH7EDTVVLHGD76IZ6HVTTB5/graph.json","fetch_events":"https://pith.science/api/pith-number/P2YTH7EDTVVLHGD76IZ6HVTTB5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/P2YTH7EDTVVLHGD76IZ6HVTTB5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/P2YTH7EDTVVLHGD76IZ6HVTTB5/action/storage_attestation","attest_author":"https://pith.science/pith/P2YTH7EDTVVLHGD76IZ6HVTTB5/action/author_attestation","sign_citation":"https://pith.science/pith/P2YTH7EDTVVLHGD76IZ6HVTTB5/action/citation_signature","submit_replication":"https://pith.science/pith/P2YTH7EDTVVLHGD76IZ6HVTTB5/action/replication_record"}},"created_at":"2026-05-18T00:55:34.803971+00:00","updated_at":"2026-05-18T00:55:34.803971+00:00"}