{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:TQN3CZ2E56TQ2EBYDMZ7XA3EFK","short_pith_number":"pith:TQN3CZ2E","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"},"canonical_sha256":"9c1bb16744efa70d10381b33fb83642a8b96d1cd737c294afca837c5414110a5","source":{"kind":"arxiv","id":"2607.11241","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.11241","created_at":"2026-07-14T01:22:24Z"},{"alias_kind":"arxiv_version","alias_value":"2607.11241v1","created_at":"2026-07-14T01:22:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.11241","created_at":"2026-07-14T01:22:24Z"},{"alias_kind":"pith_short_12","alias_value":"TQN3CZ2E56TQ","created_at":"2026-07-14T01:22:24Z"},{"alias_kind":"pith_short_16","alias_value":"TQN3CZ2E56TQ2EBY","created_at":"2026-07-14T01:22:24Z"},{"alias_kind":"pith_short_8","alias_value":"TQN3CZ2E","created_at":"2026-07-14T01:22:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:TQN3CZ2E56TQ2EBYDMZ7XA3EFK","target":"record","payload":{"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"},"canonical_sha256":"9c1bb16744efa70d10381b33fb83642a8b96d1cd737c294afca837c5414110a5","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"},"source_kind":"arxiv","source_id":"2607.11241","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-14T01:22:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mLRZl/eExEjumbtnIWY6da0IfrhzyWC+1RYOPqF1tt6MZURtYl9/jaqP/o/LpuFP70tYtCuh0KEu8DDDQoppAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T08:35:09.402460Z"},"content_sha256":"5422b54d703a2f5421a7b39a836505386955da18f42e61f23d1bef4b576257ce","schema_version":"1.0","event_id":"sha256:5422b54d703a2f5421a7b39a836505386955da18f42e61f23d1bef4b576257ce"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:TQN3CZ2E56TQ2EBYDMZ7XA3EFK","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-14T01:22:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+d/Uw/BSvJ24eRYpakeq0SegHbhwzV/+g/wAoBmRBl92L6Vg//fLNlrBxyS9WsMjgEFzDXRqcRFtX9YjfrAeAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T08:35:09.403019Z"},"content_sha256":"f736515091a3ea60d30c5bb6d7052b22163e33b83cae4c1838e55fa8af253246","schema_version":"1.0","event_id":"sha256:f736515091a3ea60d30c5bb6d7052b22163e33b83cae4c1838e55fa8af253246"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TQN3CZ2E56TQ2EBYDMZ7XA3EFK/bundle.json","state_url":"https://pith.science/pith/TQN3CZ2E56TQ2EBYDMZ7XA3EFK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TQN3CZ2E56TQ2EBYDMZ7XA3EFK/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-03T08:35:09Z","links":{"resolver":"https://pith.science/pith/TQN3CZ2E56TQ2EBYDMZ7XA3EFK","bundle":"https://pith.science/pith/TQN3CZ2E56TQ2EBYDMZ7XA3EFK/bundle.json","state":"https://pith.science/pith/TQN3CZ2E56TQ2EBYDMZ7XA3EFK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TQN3CZ2E56TQ2EBYDMZ7XA3EFK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:TQN3CZ2E56TQ2EBYDMZ7XA3EFK","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":"c462536b862b9047f97f0a207f391831682cd145640ef55704daca46b55b5dfd","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-07-13T08:27:22Z","title_canon_sha256":"1d32a399b758bcd0d940a03fe14af74a2ff6dec48880d4ffe3abdd3a9d4009a7"},"schema_version":"1.0","source":{"id":"2607.11241","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.11241","created_at":"2026-07-14T01:22:24Z"},{"alias_kind":"arxiv_version","alias_value":"2607.11241v1","created_at":"2026-07-14T01:22:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.11241","created_at":"2026-07-14T01:22:24Z"},{"alias_kind":"pith_short_12","alias_value":"TQN3CZ2E56TQ","created_at":"2026-07-14T01:22:24Z"},{"alias_kind":"pith_short_16","alias_value":"TQN3CZ2E56TQ2EBY","created_at":"2026-07-14T01:22:24Z"},{"alias_kind":"pith_short_8","alias_value":"TQN3CZ2E","created_at":"2026-07-14T01:22:24Z"}],"graph_snapshots":[{"event_id":"sha256:f736515091a3ea60d30c5bb6d7052b22163e33b83cae4c1838e55fa8af253246","target":"graph","created_at":"2026-07-14T01:22:24Z","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/2607.11241/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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 ","authors_text":"Antoine Deza, Sebastian Pokutta, Yan Gerard, Yijun Ma","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-07-13T08:27:22Z","title":"Bounded-Support Additive Latin Transversals via Color-Counted Matching"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.11241","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:5422b54d703a2f5421a7b39a836505386955da18f42e61f23d1bef4b576257ce","target":"record","created_at":"2026-07-14T01:22:24Z","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":"c462536b862b9047f97f0a207f391831682cd145640ef55704daca46b55b5dfd","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-07-13T08:27:22Z","title_canon_sha256":"1d32a399b758bcd0d940a03fe14af74a2ff6dec48880d4ffe3abdd3a9d4009a7"},"schema_version":"1.0","source":{"id":"2607.11241","kind":"arxiv","version":1}},"canonical_sha256":"9c1bb16744efa70d10381b33fb83642a8b96d1cd737c294afca837c5414110a5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9c1bb16744efa70d10381b33fb83642a8b96d1cd737c294afca837c5414110a5","first_computed_at":"2026-07-14T01:22:24.272599Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-14T01:22:24.272599Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vRSoNCk2MOkfE25UqfNBACsQ+qBW38TnHALVgD9kwhBt+GDNm3Qw9708wL2109ED2v/eAQhyHDLql3vpx2m2CQ==","signature_status":"signed_v1","signed_at":"2026-07-14T01:22:24.273554Z","signed_message":"canonical_sha256_bytes"},"source_id":"2607.11241","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5422b54d703a2f5421a7b39a836505386955da18f42e61f23d1bef4b576257ce","sha256:f736515091a3ea60d30c5bb6d7052b22163e33b83cae4c1838e55fa8af253246"],"state_sha256":"d02a3c4770c2ff23551481661ca70dd9a37247a55659406303745b04b78fae7c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fJtFj2x9ETjZJJiFJDjt3ONtI9ilwVbL3EV+1CCtPjm8hk67Rn1ISVTce2rGVcwGfkvC3PyJJ0X4XpBOyT7iCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-03T08:35:09.408977Z","bundle_sha256":"2257e3c00b374d462d15709a18a65863bf6902c3a2da46b40a86629889229633"}}