{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:765Q7F3OTZS4G7KLQDI44A2YYH","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"65ff520437c0d3b4ceb690e1798597b0ef57989849d875b75dce8892647e7a19","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-05-12T16:14:09Z","title_canon_sha256":"821f9f4d49ce5ee48cba537dd9f3363d0a51e4b8bbfee0852b5b37f5e479604c"},"schema_version":"1.0","source":{"id":"2505.07706","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2505.07706","created_at":"2026-07-05T11:01:52Z"},{"alias_kind":"arxiv_version","alias_value":"2505.07706v1","created_at":"2026-07-05T11:01:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.07706","created_at":"2026-07-05T11:01:52Z"},{"alias_kind":"pith_short_12","alias_value":"765Q7F3OTZS4","created_at":"2026-07-05T11:01:52Z"},{"alias_kind":"pith_short_16","alias_value":"765Q7F3OTZS4G7KL","created_at":"2026-07-05T11:01:52Z"},{"alias_kind":"pith_short_8","alias_value":"765Q7F3O","created_at":"2026-07-05T11:01:52Z"}],"graph_snapshots":[{"event_id":"sha256:7fd49b3b1e58d4ef60bd0d94bd51682f5e5686a71d06cb5d8845aec3841254fd","target":"graph","created_at":"2026-07-05T11:01:52Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2505.07706/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","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","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-05-12T16:14:09Z","title":"The generalized trifference problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.07706","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:9f87b45449c565001c875fed5cad66867d87d7449789e1bdacf0c5640e83dd9d","target":"record","created_at":"2026-07-05T11:01:52Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"65ff520437c0d3b4ceb690e1798597b0ef57989849d875b75dce8892647e7a19","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-05-12T16:14:09Z","title_canon_sha256":"821f9f4d49ce5ee48cba537dd9f3363d0a51e4b8bbfee0852b5b37f5e479604c"},"schema_version":"1.0","source":{"id":"2505.07706","kind":"arxiv","version":1}},"canonical_sha256":"ffbb0f976e9e65c37d4b80d1ce0358c1ec174c5650310712cf13964123bad405","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ffbb0f976e9e65c37d4b80d1ce0358c1ec174c5650310712cf13964123bad405","first_computed_at":"2026-07-05T11:01:52.058986Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:01:52.058986Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"UAdQdhbFSJzX2/gIvGuVoL7aEfk0aauNjM50Oxo8NKUGQUSGC04q2Q3klPR6377wLmca6htWc5k8ZyqdNqfABg==","signature_status":"signed_v1","signed_at":"2026-07-05T11:01:52.059450Z","signed_message":"canonical_sha256_bytes"},"source_id":"2505.07706","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9f87b45449c565001c875fed5cad66867d87d7449789e1bdacf0c5640e83dd9d","sha256:7fd49b3b1e58d4ef60bd0d94bd51682f5e5686a71d06cb5d8845aec3841254fd"],"state_sha256":"f5fdde446574d1e1d744818cf6d71c6fe5a4914c1a53bd690a706eed448eecb0"}