{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:ASXADSLWN4THH2R7IJLP2GSDR2","short_pith_number":"pith:ASXADSLW","canonical_record":{"source":{"id":"1208.2847","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-08-14T12:38:57Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"f8e019e25a832db03af7e3e7518924a8c22185f7624ccad578d4e887da8d9ad0","abstract_canon_sha256":"03c5769192f63b0ea3f5313f545ec6c8d6fd0f8890a881bbdcf37e1530feff0b"},"schema_version":"1.0"},"canonical_sha256":"04ae01c9766f2673ea3f4256fd1a438eb5a71c3a726a9c604987884b8d90189b","source":{"kind":"arxiv","id":"1208.2847","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:ASXADSLWN4THH2R7IJLP2GSDR2","target":"record","payload":{"canonical_record":{"source":{"id":"1208.2847","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-08-14T12:38:57Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"f8e019e25a832db03af7e3e7518924a8c22185f7624ccad578d4e887da8d9ad0","abstract_canon_sha256":"03c5769192f63b0ea3f5313f545ec6c8d6fd0f8890a881bbdcf37e1530feff0b"},"schema_version":"1.0"},"canonical_sha256":"04ae01c9766f2673ea3f4256fd1a438eb5a71c3a726a9c604987884b8d90189b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:07:41.326265Z","signature_b64":"KYwPiEjsl9sq1M6Pt4SW3bSC7b1uP/nUemugSv3r9sz5PdW12X6A2yWRf7Vs2jVagZKaEI8zpwFhAx+Vd6Y6CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"04ae01c9766f2673ea3f4256fd1a438eb5a71c3a726a9c604987884b8d90189b","last_reissued_at":"2026-05-18T03:07:41.325730Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:07:41.325730Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1208.2847","source_version":3,"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-05-18T03:07:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"r2LsEjRblE7OVffjsrQ/74O9Nqq7FDkRX4zy8R/b9PAvHzwp9TpihlI+MFvqx5xBDNnigLp7n3bBLAHSbnTiCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T16:00:38.200354Z"},"content_sha256":"7062c5b6f245562e28c9945035f5c59a0b4f3e2196b70a295b63859fbe823707","schema_version":"1.0","event_id":"sha256:7062c5b6f245562e28c9945035f5c59a0b4f3e2196b70a295b63859fbe823707"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:ASXADSLWN4THH2R7IJLP2GSDR2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Maximum size of reverse-free sets of permutations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Josef Cibulka","submitted_at":"2012-08-14T12:38:57Z","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)}."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1208.2847","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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-05-18T03:07:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tek7+SA7u6fBubrIEN2O9/4V7eb6fcWvhmfPCe54CsnoJFuIAop1rZGM4xihJP3sBWT9cJj5Fv7vTbTlaK5tDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T16:00:38.201051Z"},"content_sha256":"6ea6106f6c2cb587c189c3739e7b4f039096baf263503b2886fc8d495fcc2d12","schema_version":"1.0","event_id":"sha256:6ea6106f6c2cb587c189c3739e7b4f039096baf263503b2886fc8d495fcc2d12"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ASXADSLWN4THH2R7IJLP2GSDR2/bundle.json","state_url":"https://pith.science/pith/ASXADSLWN4THH2R7IJLP2GSDR2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ASXADSLWN4THH2R7IJLP2GSDR2/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-06-11T16:00:38Z","links":{"resolver":"https://pith.science/pith/ASXADSLWN4THH2R7IJLP2GSDR2","bundle":"https://pith.science/pith/ASXADSLWN4THH2R7IJLP2GSDR2/bundle.json","state":"https://pith.science/pith/ASXADSLWN4THH2R7IJLP2GSDR2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ASXADSLWN4THH2R7IJLP2GSDR2/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"U+7+EgA8kQ4qWwWzSFAOWMnEzkwhS3dV7aMqOALs+RunXSQJ4OuZRkoUnrpKeZTVH8lbeg0gAgSFP7a8/o9DDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T16:00:38.205510Z","bundle_sha256":"6c74bf1bf8676926db81b083314e6a28d3fe7a1ea70a6ce8e53f2f3e33d52819"}}