{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:ASXADSLWN4THH2R7IJLP2GSDR2","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":"03c5769192f63b0ea3f5313f545ec6c8d6fd0f8890a881bbdcf37e1530feff0b","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-08-14T12:38:57Z","title_canon_sha256":"f8e019e25a832db03af7e3e7518924a8c22185f7624ccad578d4e887da8d9ad0"},"schema_version":"1.0","source":{"id":"1208.2847","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1208.2847","created_at":"2026-05-18T03:07:41Z"},{"alias_kind":"arxiv_version","alias_value":"1208.2847v3","created_at":"2026-05-18T03:07:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1208.2847","created_at":"2026-05-18T03:07:41Z"},{"alias_kind":"pith_short_12","alias_value":"ASXADSLWN4TH","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_16","alias_value":"ASXADSLWN4THH2R7","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_8","alias_value":"ASXADSLW","created_at":"2026-05-18T12:26:58Z"}],"graph_snapshots":[{"event_id":"sha256:6ea6106f6c2cb587c189c3739e7b4f039096baf263503b2886fc8d495fcc2d12","target":"graph","created_at":"2026-05-18T03:07:41Z","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"},"paper":{"abstract_excerpt":"Two words have a reverse if they have the same pair of distinct letters on the same pair of positions, but in reversed order. A set of words no two of which have a reverse is said to be reverse-free. Let F(n,k) be the maximum size of a reverse-free set of words from [n]^k where no letter repeats within a word. We show the following lower and upper bounds in the case n >= k: F(n,k) \\in n^k k^{-k/2 + O(k/log k)}. As a consequence of the lower bound, a set of n-permutations each two having a reverse has size at most n^{n/2 + O(n/log n)}.","authors_text":"Josef Cibulka","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-08-14T12:38:57Z","title":"Maximum size of reverse-free sets of permutations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1208.2847","kind":"arxiv","version":3},"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:7062c5b6f245562e28c9945035f5c59a0b4f3e2196b70a295b63859fbe823707","target":"record","created_at":"2026-05-18T03:07:41Z","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":"03c5769192f63b0ea3f5313f545ec6c8d6fd0f8890a881bbdcf37e1530feff0b","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-08-14T12:38:57Z","title_canon_sha256":"f8e019e25a832db03af7e3e7518924a8c22185f7624ccad578d4e887da8d9ad0"},"schema_version":"1.0","source":{"id":"1208.2847","kind":"arxiv","version":3}},"canonical_sha256":"04ae01c9766f2673ea3f4256fd1a438eb5a71c3a726a9c604987884b8d90189b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"04ae01c9766f2673ea3f4256fd1a438eb5a71c3a726a9c604987884b8d90189b","first_computed_at":"2026-05-18T03:07:41.325730Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:07:41.325730Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KYwPiEjsl9sq1M6Pt4SW3bSC7b1uP/nUemugSv3r9sz5PdW12X6A2yWRf7Vs2jVagZKaEI8zpwFhAx+Vd6Y6CQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:07:41.326265Z","signed_message":"canonical_sha256_bytes"},"source_id":"1208.2847","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7062c5b6f245562e28c9945035f5c59a0b4f3e2196b70a295b63859fbe823707","sha256:6ea6106f6c2cb587c189c3739e7b4f039096baf263503b2886fc8d495fcc2d12"],"state_sha256":"deef5aa60b3b56371a0e2493ea519027021fe3dd51972fef5c99af323bb4cd80"}