{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:KOAQO6AMSGPGVHNJ5PLDWFUZIP","short_pith_number":"pith:KOAQO6AM","schema_version":"1.0","canonical_sha256":"538107780c919e6a9da9ebd63b169943eeacbc25853a071decf8f5db50bccd85","source":{"kind":"arxiv","id":"1708.07263","version":1},"attestation_state":"computed","paper":{"title":"An upper bound on tricolored ordered sum-free sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.NT"],"primary_cat":"math.CO","authors_text":"Sang-il Oum, Taegyun Kim","submitted_at":"2017-08-24T03:10:09Z","abstract_excerpt":"We present a strengthening of the lemma on the lower bound of the slice rank by Tao (2016) motivated by the Croot-Lev-Pach-Ellenberg-Gijswijt bound on cap sets (2017, 2017). The Croot-Lev-Pach-Ellenberg-Gijswijt method and the lemma of Tao are based on the fact that the rank of a diagonal matrix is equal to the number of non-zero diagonal entries. Our lemma is based on the rank of upper-triangular matrices. This stronger lemma allows us to prove the following extension of the Ellenberg-Gijswijt result (2017). A tricolored ordered sum-free set in $\\mathbb F_p^n$ is a collection $\\{(a_i,b_i,c_i)"},"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":"1708.07263","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-08-24T03:10:09Z","cross_cats_sorted":["math.NT"],"title_canon_sha256":"fc72fef18d793c73fad248337b033c73f59cf3b3a2e00257ba6129d24ff0f504","abstract_canon_sha256":"b45e8dca7e61b560eb3b1c75c4cc599c6ce367d980e1649d184131158c98c686"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:36:46.746647Z","signature_b64":"wdvKw8Go2ih8k8r+xZHQbzMj6kGFJjcueHiNhTo0QfHD0jx+/AuQG5+SGuW4KP5fabrcBaMkhd4AcEvk7fIwCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"538107780c919e6a9da9ebd63b169943eeacbc25853a071decf8f5db50bccd85","last_reissued_at":"2026-05-18T00:36:46.745984Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:36:46.745984Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An upper bound on tricolored ordered sum-free sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.NT"],"primary_cat":"math.CO","authors_text":"Sang-il Oum, Taegyun Kim","submitted_at":"2017-08-24T03:10:09Z","abstract_excerpt":"We present a strengthening of the lemma on the lower bound of the slice rank by Tao (2016) motivated by the Croot-Lev-Pach-Ellenberg-Gijswijt bound on cap sets (2017, 2017). The Croot-Lev-Pach-Ellenberg-Gijswijt method and the lemma of Tao are based on the fact that the rank of a diagonal matrix is equal to the number of non-zero diagonal entries. Our lemma is based on the rank of upper-triangular matrices. This stronger lemma allows us to prove the following extension of the Ellenberg-Gijswijt result (2017). A tricolored ordered sum-free set in $\\mathbb F_p^n$ is a collection $\\{(a_i,b_i,c_i)"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.07263","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":"1708.07263","created_at":"2026-05-18T00:36:46.746086+00:00"},{"alias_kind":"arxiv_version","alias_value":"1708.07263v1","created_at":"2026-05-18T00:36:46.746086+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.07263","created_at":"2026-05-18T00:36:46.746086+00:00"},{"alias_kind":"pith_short_12","alias_value":"KOAQO6AMSGPG","created_at":"2026-05-18T12:31:24.725408+00:00"},{"alias_kind":"pith_short_16","alias_value":"KOAQO6AMSGPGVHNJ","created_at":"2026-05-18T12:31:24.725408+00:00"},{"alias_kind":"pith_short_8","alias_value":"KOAQO6AM","created_at":"2026-05-18T12:31:24.725408+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/KOAQO6AMSGPGVHNJ5PLDWFUZIP","json":"https://pith.science/pith/KOAQO6AMSGPGVHNJ5PLDWFUZIP.json","graph_json":"https://pith.science/api/pith-number/KOAQO6AMSGPGVHNJ5PLDWFUZIP/graph.json","events_json":"https://pith.science/api/pith-number/KOAQO6AMSGPGVHNJ5PLDWFUZIP/events.json","paper":"https://pith.science/paper/KOAQO6AM"},"agent_actions":{"view_html":"https://pith.science/pith/KOAQO6AMSGPGVHNJ5PLDWFUZIP","download_json":"https://pith.science/pith/KOAQO6AMSGPGVHNJ5PLDWFUZIP.json","view_paper":"https://pith.science/paper/KOAQO6AM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1708.07263&json=true","fetch_graph":"https://pith.science/api/pith-number/KOAQO6AMSGPGVHNJ5PLDWFUZIP/graph.json","fetch_events":"https://pith.science/api/pith-number/KOAQO6AMSGPGVHNJ5PLDWFUZIP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KOAQO6AMSGPGVHNJ5PLDWFUZIP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KOAQO6AMSGPGVHNJ5PLDWFUZIP/action/storage_attestation","attest_author":"https://pith.science/pith/KOAQO6AMSGPGVHNJ5PLDWFUZIP/action/author_attestation","sign_citation":"https://pith.science/pith/KOAQO6AMSGPGVHNJ5PLDWFUZIP/action/citation_signature","submit_replication":"https://pith.science/pith/KOAQO6AMSGPGVHNJ5PLDWFUZIP/action/replication_record"}},"created_at":"2026-05-18T00:36:46.746086+00:00","updated_at":"2026-05-18T00:36:46.746086+00:00"}