{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:765Q7F3OTZS4G7KLQDI44A2YYH","short_pith_number":"pith:765Q7F3O","schema_version":"1.0","canonical_sha256":"ffbb0f976e9e65c37d4b80d1ce0358c1ec174c5650310712cf13964123bad405","source":{"kind":"arxiv","id":"2505.07706","version":1},"attestation_state":"computed","paper":{"title":"The generalized trifference problem","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"math.CO","authors_text":"Anurag Bishnoi, Bart{\\l}omiej Kielak, Benedek Kov\\'acs, G\\'abor Somlai, M\\'at\\'e Vizer, Zeyu Zheng, Zolt\\'an L\\'or\\'ant Nagy","submitted_at":"2025-05-12T16:14:09Z","abstract_excerpt":"We study the problem of finding the largest number $T(n, m)$ of ternary vectors of length $n$ such that for any three distinct vectors there are at least $m$ coordinates where they pairwise differ.\n  For $m = 1$, this is the classical trifference problem which is wide open.\n  We prove upper and lower bounds on $T(n, m)$ for various ranges of the parameter $m$ and determine the phase transition threshold on $m=m(n)$ where $T(n, m)$ jumps from constant to exponential in $n$.\n  By relating the linear version of this problem to a problem on blocking sets in finite geometry, we give explicit constr"},"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":"2505.07706","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-05-12T16:14:09Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"821f9f4d49ce5ee48cba537dd9f3363d0a51e4b8bbfee0852b5b37f5e479604c","abstract_canon_sha256":"65ff520437c0d3b4ceb690e1798597b0ef57989849d875b75dce8892647e7a19"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:01:52.059450Z","signature_b64":"UAdQdhbFSJzX2/gIvGuVoL7aEfk0aauNjM50Oxo8NKUGQUSGC04q2Q3klPR6377wLmca6htWc5k8ZyqdNqfABg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ffbb0f976e9e65c37d4b80d1ce0358c1ec174c5650310712cf13964123bad405","last_reissued_at":"2026-07-05T11:01:52.058986Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:01:52.058986Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The generalized trifference problem","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"math.CO","authors_text":"Anurag Bishnoi, Bart{\\l}omiej Kielak, Benedek Kov\\'acs, G\\'abor Somlai, M\\'at\\'e Vizer, Zeyu Zheng, Zolt\\'an L\\'or\\'ant Nagy","submitted_at":"2025-05-12T16:14:09Z","abstract_excerpt":"We study the problem of finding the largest number $T(n, m)$ of ternary vectors of length $n$ such that for any three distinct vectors there are at least $m$ coordinates where they pairwise differ.\n  For $m = 1$, this is the classical trifference problem which is wide open.\n  We prove upper and lower bounds on $T(n, m)$ for various ranges of the parameter $m$ and determine the phase transition threshold on $m=m(n)$ where $T(n, m)$ jumps from constant to exponential in $n$.\n  By relating the linear version of this problem to a problem on blocking sets in finite geometry, we give explicit constr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.07706","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2505.07706/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":"2505.07706","created_at":"2026-07-05T11:01:52.059039+00:00"},{"alias_kind":"arxiv_version","alias_value":"2505.07706v1","created_at":"2026-07-05T11:01:52.059039+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.07706","created_at":"2026-07-05T11:01:52.059039+00:00"},{"alias_kind":"pith_short_12","alias_value":"765Q7F3OTZS4","created_at":"2026-07-05T11:01:52.059039+00:00"},{"alias_kind":"pith_short_16","alias_value":"765Q7F3OTZS4G7KL","created_at":"2026-07-05T11:01:52.059039+00:00"},{"alias_kind":"pith_short_8","alias_value":"765Q7F3O","created_at":"2026-07-05T11:01:52.059039+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/765Q7F3OTZS4G7KLQDI44A2YYH","json":"https://pith.science/pith/765Q7F3OTZS4G7KLQDI44A2YYH.json","graph_json":"https://pith.science/api/pith-number/765Q7F3OTZS4G7KLQDI44A2YYH/graph.json","events_json":"https://pith.science/api/pith-number/765Q7F3OTZS4G7KLQDI44A2YYH/events.json","paper":"https://pith.science/paper/765Q7F3O"},"agent_actions":{"view_html":"https://pith.science/pith/765Q7F3OTZS4G7KLQDI44A2YYH","download_json":"https://pith.science/pith/765Q7F3OTZS4G7KLQDI44A2YYH.json","view_paper":"https://pith.science/paper/765Q7F3O","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2505.07706&json=true","fetch_graph":"https://pith.science/api/pith-number/765Q7F3OTZS4G7KLQDI44A2YYH/graph.json","fetch_events":"https://pith.science/api/pith-number/765Q7F3OTZS4G7KLQDI44A2YYH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/765Q7F3OTZS4G7KLQDI44A2YYH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/765Q7F3OTZS4G7KLQDI44A2YYH/action/storage_attestation","attest_author":"https://pith.science/pith/765Q7F3OTZS4G7KLQDI44A2YYH/action/author_attestation","sign_citation":"https://pith.science/pith/765Q7F3OTZS4G7KLQDI44A2YYH/action/citation_signature","submit_replication":"https://pith.science/pith/765Q7F3OTZS4G7KLQDI44A2YYH/action/replication_record"}},"created_at":"2026-07-05T11:01:52.059039+00:00","updated_at":"2026-07-05T11:01:52.059039+00:00"}