{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:KSGCP6JWZP54DQWRCFZARXP7JG","short_pith_number":"pith:KSGCP6JW","schema_version":"1.0","canonical_sha256":"548c27f936cbfbc1c2d1117208ddff499ce0a05d835ef2fcd7e2cd8a28ef0d5f","source":{"kind":"arxiv","id":"1607.04336","version":1},"attestation_state":"computed","paper":{"title":"The Decision Tree Complexity for $k$-SUM is at most Nearly Quadratic","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Esther Ezra, Micha Sharir","submitted_at":"2016-07-14T22:17:11Z","abstract_excerpt":"Following a recent improvement of Cardinal et al. on the complexity of a linear decision tree for $k$-SUM, resulting in $O(n^3 \\log^3{n})$ linear queries, we present a further improvement to $O(n^2 \\log^2{n})$ such queries."},"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":"1607.04336","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-07-14T22:17:11Z","cross_cats_sorted":[],"title_canon_sha256":"c6286ab3afce6cbe59311981e7bb3c0afb13a0f518d5a35086dd58d01c044cdd","abstract_canon_sha256":"6500b9b43ccdee9766e54970fee096e1abc1391beaef2308d89e3f049eea3e3c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:11:01.484973Z","signature_b64":"9JiKTK6Dgg3PQT4wxnzZxyaVlEVRCgvh6RehDdEaeqgLGXQ7BgR6sdE9ZNQw8Fp1pRpCKauIATWHiMjWYHNYAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"548c27f936cbfbc1c2d1117208ddff499ce0a05d835ef2fcd7e2cd8a28ef0d5f","last_reissued_at":"2026-05-18T01:11:01.484365Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:11:01.484365Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Decision Tree Complexity for $k$-SUM is at most Nearly Quadratic","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Esther Ezra, Micha Sharir","submitted_at":"2016-07-14T22:17:11Z","abstract_excerpt":"Following a recent improvement of Cardinal et al. on the complexity of a linear decision tree for $k$-SUM, resulting in $O(n^3 \\log^3{n})$ linear queries, we present a further improvement to $O(n^2 \\log^2{n})$ such queries."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.04336","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":"1607.04336","created_at":"2026-05-18T01:11:01.484457+00:00"},{"alias_kind":"arxiv_version","alias_value":"1607.04336v1","created_at":"2026-05-18T01:11:01.484457+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.04336","created_at":"2026-05-18T01:11:01.484457+00:00"},{"alias_kind":"pith_short_12","alias_value":"KSGCP6JWZP54","created_at":"2026-05-18T12:30:29.479603+00:00"},{"alias_kind":"pith_short_16","alias_value":"KSGCP6JWZP54DQWR","created_at":"2026-05-18T12:30:29.479603+00:00"},{"alias_kind":"pith_short_8","alias_value":"KSGCP6JW","created_at":"2026-05-18T12:30:29.479603+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/KSGCP6JWZP54DQWRCFZARXP7JG","json":"https://pith.science/pith/KSGCP6JWZP54DQWRCFZARXP7JG.json","graph_json":"https://pith.science/api/pith-number/KSGCP6JWZP54DQWRCFZARXP7JG/graph.json","events_json":"https://pith.science/api/pith-number/KSGCP6JWZP54DQWRCFZARXP7JG/events.json","paper":"https://pith.science/paper/KSGCP6JW"},"agent_actions":{"view_html":"https://pith.science/pith/KSGCP6JWZP54DQWRCFZARXP7JG","download_json":"https://pith.science/pith/KSGCP6JWZP54DQWRCFZARXP7JG.json","view_paper":"https://pith.science/paper/KSGCP6JW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1607.04336&json=true","fetch_graph":"https://pith.science/api/pith-number/KSGCP6JWZP54DQWRCFZARXP7JG/graph.json","fetch_events":"https://pith.science/api/pith-number/KSGCP6JWZP54DQWRCFZARXP7JG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KSGCP6JWZP54DQWRCFZARXP7JG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KSGCP6JWZP54DQWRCFZARXP7JG/action/storage_attestation","attest_author":"https://pith.science/pith/KSGCP6JWZP54DQWRCFZARXP7JG/action/author_attestation","sign_citation":"https://pith.science/pith/KSGCP6JWZP54DQWRCFZARXP7JG/action/citation_signature","submit_replication":"https://pith.science/pith/KSGCP6JWZP54DQWRCFZARXP7JG/action/replication_record"}},"created_at":"2026-05-18T01:11:01.484457+00:00","updated_at":"2026-05-18T01:11:01.484457+00:00"}