{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:TQN3CZ2E56TQ2EBYDMZ7XA3EFK","short_pith_number":"pith:TQN3CZ2E","schema_version":"1.0","canonical_sha256":"9c1bb16744efa70d10381b33fb83642a8b96d1cd737c294afca837c5414110a5","source":{"kind":"arxiv","id":"2607.11241","version":1},"attestation_state":"computed","paper":{"title":"Bounded-Support Additive Latin Transversals via Color-Counted Matching","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DS","authors_text":"Antoine Deza, Sebastian Pokutta, Yan Gerard, Yijun Ma","submitted_at":"2026-07-13T08:27:22Z","abstract_excerpt":"We consider the following additive Latin transversal problem. Given a multiset $A=(a_1,\\dots,a_k)$ of elements of $\\mathbb Z_m$ and a set $B\\subseteq\\mathbb Z_m$ of cardinality $k$, the task is to order $B$ as $b_1,\\dots,b_k$ so that the sums $a_i+b_i$ are pairwise distinct. When $k=m$, Hall proved that a solution exists if and only if $\\sum_{i=1}^m a_i\\equiv 0 \\pmod m$; moreover, his theorem yields a polynomial-time construction. Alon proved that a solution always exists when $m$ is prime and $k<m$, but no polynomial-time construction is known in general. Our main algorithmic contribution is "},"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":"2607.11241","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-07-13T08:27:22Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"1d32a399b758bcd0d940a03fe14af74a2ff6dec48880d4ffe3abdd3a9d4009a7","abstract_canon_sha256":"c462536b862b9047f97f0a207f391831682cd145640ef55704daca46b55b5dfd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-14T01:22:24.273554Z","signature_b64":"vRSoNCk2MOkfE25UqfNBACsQ+qBW38TnHALVgD9kwhBt+GDNm3Qw9708wL2109ED2v/eAQhyHDLql3vpx2m2CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9c1bb16744efa70d10381b33fb83642a8b96d1cd737c294afca837c5414110a5","last_reissued_at":"2026-07-14T01:22:24.272599Z","signature_status":"signed_v1","first_computed_at":"2026-07-14T01:22:24.272599Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Bounded-Support Additive Latin Transversals via Color-Counted Matching","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DS","authors_text":"Antoine Deza, Sebastian Pokutta, Yan Gerard, Yijun Ma","submitted_at":"2026-07-13T08:27:22Z","abstract_excerpt":"We consider the following additive Latin transversal problem. Given a multiset $A=(a_1,\\dots,a_k)$ of elements of $\\mathbb Z_m$ and a set $B\\subseteq\\mathbb Z_m$ of cardinality $k$, the task is to order $B$ as $b_1,\\dots,b_k$ so that the sums $a_i+b_i$ are pairwise distinct. When $k=m$, Hall proved that a solution exists if and only if $\\sum_{i=1}^m a_i\\equiv 0 \\pmod m$; moreover, his theorem yields a polynomial-time construction. Alon proved that a solution always exists when $m$ is prime and $k<m$, but no polynomial-time construction is known in general. Our main algorithmic contribution is "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.11241","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/2607.11241/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":"2607.11241","created_at":"2026-07-14T01:22:24.273064+00:00"},{"alias_kind":"arxiv_version","alias_value":"2607.11241v1","created_at":"2026-07-14T01:22:24.273064+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.11241","created_at":"2026-07-14T01:22:24.273064+00:00"},{"alias_kind":"pith_short_12","alias_value":"TQN3CZ2E56TQ","created_at":"2026-07-14T01:22:24.273064+00:00"},{"alias_kind":"pith_short_16","alias_value":"TQN3CZ2E56TQ2EBY","created_at":"2026-07-14T01:22:24.273064+00:00"},{"alias_kind":"pith_short_8","alias_value":"TQN3CZ2E","created_at":"2026-07-14T01:22:24.273064+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/TQN3CZ2E56TQ2EBYDMZ7XA3EFK","json":"https://pith.science/pith/TQN3CZ2E56TQ2EBYDMZ7XA3EFK.json","graph_json":"https://pith.science/api/pith-number/TQN3CZ2E56TQ2EBYDMZ7XA3EFK/graph.json","events_json":"https://pith.science/api/pith-number/TQN3CZ2E56TQ2EBYDMZ7XA3EFK/events.json","paper":"https://pith.science/paper/TQN3CZ2E"},"agent_actions":{"view_html":"https://pith.science/pith/TQN3CZ2E56TQ2EBYDMZ7XA3EFK","download_json":"https://pith.science/pith/TQN3CZ2E56TQ2EBYDMZ7XA3EFK.json","view_paper":"https://pith.science/paper/TQN3CZ2E","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2607.11241&json=true","fetch_graph":"https://pith.science/api/pith-number/TQN3CZ2E56TQ2EBYDMZ7XA3EFK/graph.json","fetch_events":"https://pith.science/api/pith-number/TQN3CZ2E56TQ2EBYDMZ7XA3EFK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TQN3CZ2E56TQ2EBYDMZ7XA3EFK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TQN3CZ2E56TQ2EBYDMZ7XA3EFK/action/storage_attestation","attest_author":"https://pith.science/pith/TQN3CZ2E56TQ2EBYDMZ7XA3EFK/action/author_attestation","sign_citation":"https://pith.science/pith/TQN3CZ2E56TQ2EBYDMZ7XA3EFK/action/citation_signature","submit_replication":"https://pith.science/pith/TQN3CZ2E56TQ2EBYDMZ7XA3EFK/action/replication_record"}},"created_at":"2026-07-14T01:22:24.273064+00:00","updated_at":"2026-07-14T01:22:24.273064+00:00"}