{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:RK2UQOAWM5MPKBDJFCAA2U5AU2","short_pith_number":"pith:RK2UQOAW","schema_version":"1.0","canonical_sha256":"8ab54838166758f5046928800d53a0a68a5234ab59c28ee34330806bcf88e41f","source":{"kind":"arxiv","id":"1308.1643","version":1},"attestation_state":"computed","paper":{"title":"Improved Lower Bounds for Testing Triangle-freeness in Boolean Functions via Fast Matrix Multiplication","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Hu Fu, Robert Kleinberg","submitted_at":"2013-08-07T17:42:45Z","abstract_excerpt":"Understanding the query complexity for testing linear-invariant properties has been a central open problem in the study of algebraic property testing. Triangle-freeness in Boolean functions is a simple property whose testing complexity is unknown. Three Boolean functions $f_1$, $f_2$ and $f_3: \\mathbb{F}_2^k \\to \\{0, 1\\}$ are said to be triangle free if there is no $x, y \\in \\mathbb{F}_2^k$ such that $f_1(x) = f_2(y) = f_3(x + y) = 1$. This property is known to be strongly testable (Green 2005), but the number of queries needed is upper-bounded only by a tower of twos whose height is polynomia"},"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":"1308.1643","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-08-07T17:42:45Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"8f24473fac4968c6b9e7f16cb56088f78972a45c4e77d19f2394eb27c07752ed","abstract_canon_sha256":"a4b6e3b2cdefd119ffcdd07f70452b6dd080590663c19476402adfa70738c35b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:16:30.620151Z","signature_b64":"OYJhw5DaTuoHStz9sPwKqmbgj6/kEMIXiKk8yqLCZHFu/6bd6pRmyKyfkjvbNsc4IUFxcyuVJ/F5U45OrrFeCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8ab54838166758f5046928800d53a0a68a5234ab59c28ee34330806bcf88e41f","last_reissued_at":"2026-05-18T03:16:30.619687Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:16:30.619687Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Improved Lower Bounds for Testing Triangle-freeness in Boolean Functions via Fast Matrix Multiplication","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Hu Fu, Robert Kleinberg","submitted_at":"2013-08-07T17:42:45Z","abstract_excerpt":"Understanding the query complexity for testing linear-invariant properties has been a central open problem in the study of algebraic property testing. Triangle-freeness in Boolean functions is a simple property whose testing complexity is unknown. Three Boolean functions $f_1$, $f_2$ and $f_3: \\mathbb{F}_2^k \\to \\{0, 1\\}$ are said to be triangle free if there is no $x, y \\in \\mathbb{F}_2^k$ such that $f_1(x) = f_2(y) = f_3(x + y) = 1$. This property is known to be strongly testable (Green 2005), but the number of queries needed is upper-bounded only by a tower of twos whose height is polynomia"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.1643","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":"1308.1643","created_at":"2026-05-18T03:16:30.619752+00:00"},{"alias_kind":"arxiv_version","alias_value":"1308.1643v1","created_at":"2026-05-18T03:16:30.619752+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.1643","created_at":"2026-05-18T03:16:30.619752+00:00"},{"alias_kind":"pith_short_12","alias_value":"RK2UQOAWM5MP","created_at":"2026-05-18T12:27:57.521954+00:00"},{"alias_kind":"pith_short_16","alias_value":"RK2UQOAWM5MPKBDJ","created_at":"2026-05-18T12:27:57.521954+00:00"},{"alias_kind":"pith_short_8","alias_value":"RK2UQOAW","created_at":"2026-05-18T12:27:57.521954+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/RK2UQOAWM5MPKBDJFCAA2U5AU2","json":"https://pith.science/pith/RK2UQOAWM5MPKBDJFCAA2U5AU2.json","graph_json":"https://pith.science/api/pith-number/RK2UQOAWM5MPKBDJFCAA2U5AU2/graph.json","events_json":"https://pith.science/api/pith-number/RK2UQOAWM5MPKBDJFCAA2U5AU2/events.json","paper":"https://pith.science/paper/RK2UQOAW"},"agent_actions":{"view_html":"https://pith.science/pith/RK2UQOAWM5MPKBDJFCAA2U5AU2","download_json":"https://pith.science/pith/RK2UQOAWM5MPKBDJFCAA2U5AU2.json","view_paper":"https://pith.science/paper/RK2UQOAW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1308.1643&json=true","fetch_graph":"https://pith.science/api/pith-number/RK2UQOAWM5MPKBDJFCAA2U5AU2/graph.json","fetch_events":"https://pith.science/api/pith-number/RK2UQOAWM5MPKBDJFCAA2U5AU2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RK2UQOAWM5MPKBDJFCAA2U5AU2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RK2UQOAWM5MPKBDJFCAA2U5AU2/action/storage_attestation","attest_author":"https://pith.science/pith/RK2UQOAWM5MPKBDJFCAA2U5AU2/action/author_attestation","sign_citation":"https://pith.science/pith/RK2UQOAWM5MPKBDJFCAA2U5AU2/action/citation_signature","submit_replication":"https://pith.science/pith/RK2UQOAWM5MPKBDJFCAA2U5AU2/action/replication_record"}},"created_at":"2026-05-18T03:16:30.619752+00:00","updated_at":"2026-05-18T03:16:30.619752+00:00"}