{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:AAQZB7F7VUAB4TSU43IQGUTJT7","short_pith_number":"pith:AAQZB7F7","schema_version":"1.0","canonical_sha256":"002190fcbfad001e4e54e6d10352699ff9f0527f547675354d3065eeeed4e440","source":{"kind":"arxiv","id":"1402.0137","version":1},"attestation_state":"computed","paper":{"title":"On the Longest Common Pattern Contained in Two or More Random Permutations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Anant Godbole, Michael Earnest, Yevgeniy Rudoy","submitted_at":"2014-02-01T23:33:44Z","abstract_excerpt":"We provide upper and lower bounds for the expected length $\\mathbb E(L_{n,m})$ of the longest common pattern contained in $m$ random permutations of length $n$. We also address the tightness of the concentration of $L_{n,m}$ around $\\mathbb E(L_{n,m})$."},"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":"1402.0137","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-02-01T23:33:44Z","cross_cats_sorted":[],"title_canon_sha256":"e6c6efdbea2867bb0e438464fb69ca8c6ba6103307cb922775851714ddcb4ad0","abstract_canon_sha256":"7053287fa41f582db3b4d78d43a221f744e8cc321ea0c3368455d1d4680408e3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:00:24.671702Z","signature_b64":"Za1a1YNNpT46LoTDr0/LPFi7zL72iRvoK/4UnmOiTbVSjYxHYDB13yLSflmexX6hofacRVqqDDLVbl3uWdWsCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"002190fcbfad001e4e54e6d10352699ff9f0527f547675354d3065eeeed4e440","last_reissued_at":"2026-05-18T03:00:24.670663Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:00:24.670663Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Longest Common Pattern Contained in Two or More Random Permutations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Anant Godbole, Michael Earnest, Yevgeniy Rudoy","submitted_at":"2014-02-01T23:33:44Z","abstract_excerpt":"We provide upper and lower bounds for the expected length $\\mathbb E(L_{n,m})$ of the longest common pattern contained in $m$ random permutations of length $n$. We also address the tightness of the concentration of $L_{n,m}$ around $\\mathbb E(L_{n,m})$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.0137","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":""},"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":"1402.0137","created_at":"2026-05-18T03:00:24.670831+00:00"},{"alias_kind":"arxiv_version","alias_value":"1402.0137v1","created_at":"2026-05-18T03:00:24.670831+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.0137","created_at":"2026-05-18T03:00:24.670831+00:00"},{"alias_kind":"pith_short_12","alias_value":"AAQZB7F7VUAB","created_at":"2026-05-18T12:28:19.803747+00:00"},{"alias_kind":"pith_short_16","alias_value":"AAQZB7F7VUAB4TSU","created_at":"2026-05-18T12:28:19.803747+00:00"},{"alias_kind":"pith_short_8","alias_value":"AAQZB7F7","created_at":"2026-05-18T12:28:19.803747+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/AAQZB7F7VUAB4TSU43IQGUTJT7","json":"https://pith.science/pith/AAQZB7F7VUAB4TSU43IQGUTJT7.json","graph_json":"https://pith.science/api/pith-number/AAQZB7F7VUAB4TSU43IQGUTJT7/graph.json","events_json":"https://pith.science/api/pith-number/AAQZB7F7VUAB4TSU43IQGUTJT7/events.json","paper":"https://pith.science/paper/AAQZB7F7"},"agent_actions":{"view_html":"https://pith.science/pith/AAQZB7F7VUAB4TSU43IQGUTJT7","download_json":"https://pith.science/pith/AAQZB7F7VUAB4TSU43IQGUTJT7.json","view_paper":"https://pith.science/paper/AAQZB7F7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1402.0137&json=true","fetch_graph":"https://pith.science/api/pith-number/AAQZB7F7VUAB4TSU43IQGUTJT7/graph.json","fetch_events":"https://pith.science/api/pith-number/AAQZB7F7VUAB4TSU43IQGUTJT7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AAQZB7F7VUAB4TSU43IQGUTJT7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AAQZB7F7VUAB4TSU43IQGUTJT7/action/storage_attestation","attest_author":"https://pith.science/pith/AAQZB7F7VUAB4TSU43IQGUTJT7/action/author_attestation","sign_citation":"https://pith.science/pith/AAQZB7F7VUAB4TSU43IQGUTJT7/action/citation_signature","submit_replication":"https://pith.science/pith/AAQZB7F7VUAB4TSU43IQGUTJT7/action/replication_record"}},"created_at":"2026-05-18T03:00:24.670831+00:00","updated_at":"2026-05-18T03:00:24.670831+00:00"}