{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:35RSQAQJ6Y4E7GDPKPMGJUB5HR","short_pith_number":"pith:35RSQAQJ","schema_version":"1.0","canonical_sha256":"df63280209f6384f986f53d864d03d3c74f7d49b2e290243c6bbf4062cec8168","source":{"kind":"arxiv","id":"1311.3332","version":1},"attestation_state":"computed","paper":{"title":"Frame patterns in n-cycles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jeffrey Remmel, Miles Jones, Sergey Kitaev","submitted_at":"2013-11-13T22:56:41Z","abstract_excerpt":"In this paper, we study the distribution of the number of occurrences of the simplest frame pattern, called the $\\mu$ pattern, in $n$-cycles. Given an $n$-cycle $C$, we say that a pair $\\langle i,j \\rangle$ matches the $\\mu$ pattern if $i < j$ and as we traverse around $C$ in a clockwise direction starting at $i$ and ending at $j$, we never encounter a $k$ with $i < k < j$. We say that $ \\langle i,j \\rangle$ is a nontrivial $\\mu$-match if $i+1 < j$. Also, an $n$-cycle $C$ is incontractible if there is no $i$ such that $i+1$ immediately follows $i$ in $C$.\n  We show that the number of incontrac"},"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":"1311.3332","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-11-13T22:56:41Z","cross_cats_sorted":[],"title_canon_sha256":"09091924fbd65290a2c4b7025133b6ad89b6910bacfca4aff260ffe4f15e6039","abstract_canon_sha256":"71119af34ded8df27d9399a069864ec135fa436aa6d4548d2e25c5bb51fdb72a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:07:11.785176Z","signature_b64":"JFYENCqphg2G4rKLUwvxri/cyvw5NDirsvi450byawrTLc+MQMzXdk24ZrGTAeVN960KSy+UO881jLReKM1YCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"df63280209f6384f986f53d864d03d3c74f7d49b2e290243c6bbf4062cec8168","last_reissued_at":"2026-05-18T03:07:11.784397Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:07:11.784397Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Frame patterns in n-cycles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jeffrey Remmel, Miles Jones, Sergey Kitaev","submitted_at":"2013-11-13T22:56:41Z","abstract_excerpt":"In this paper, we study the distribution of the number of occurrences of the simplest frame pattern, called the $\\mu$ pattern, in $n$-cycles. Given an $n$-cycle $C$, we say that a pair $\\langle i,j \\rangle$ matches the $\\mu$ pattern if $i < j$ and as we traverse around $C$ in a clockwise direction starting at $i$ and ending at $j$, we never encounter a $k$ with $i < k < j$. We say that $ \\langle i,j \\rangle$ is a nontrivial $\\mu$-match if $i+1 < j$. Also, an $n$-cycle $C$ is incontractible if there is no $i$ such that $i+1$ immediately follows $i$ in $C$.\n  We show that the number of incontrac"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.3332","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":"1311.3332","created_at":"2026-05-18T03:07:11.784506+00:00"},{"alias_kind":"arxiv_version","alias_value":"1311.3332v1","created_at":"2026-05-18T03:07:11.784506+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.3332","created_at":"2026-05-18T03:07:11.784506+00:00"},{"alias_kind":"pith_short_12","alias_value":"35RSQAQJ6Y4E","created_at":"2026-05-18T12:27:32.513160+00:00"},{"alias_kind":"pith_short_16","alias_value":"35RSQAQJ6Y4E7GDP","created_at":"2026-05-18T12:27:32.513160+00:00"},{"alias_kind":"pith_short_8","alias_value":"35RSQAQJ","created_at":"2026-05-18T12:27:32.513160+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/35RSQAQJ6Y4E7GDPKPMGJUB5HR","json":"https://pith.science/pith/35RSQAQJ6Y4E7GDPKPMGJUB5HR.json","graph_json":"https://pith.science/api/pith-number/35RSQAQJ6Y4E7GDPKPMGJUB5HR/graph.json","events_json":"https://pith.science/api/pith-number/35RSQAQJ6Y4E7GDPKPMGJUB5HR/events.json","paper":"https://pith.science/paper/35RSQAQJ"},"agent_actions":{"view_html":"https://pith.science/pith/35RSQAQJ6Y4E7GDPKPMGJUB5HR","download_json":"https://pith.science/pith/35RSQAQJ6Y4E7GDPKPMGJUB5HR.json","view_paper":"https://pith.science/paper/35RSQAQJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1311.3332&json=true","fetch_graph":"https://pith.science/api/pith-number/35RSQAQJ6Y4E7GDPKPMGJUB5HR/graph.json","fetch_events":"https://pith.science/api/pith-number/35RSQAQJ6Y4E7GDPKPMGJUB5HR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/35RSQAQJ6Y4E7GDPKPMGJUB5HR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/35RSQAQJ6Y4E7GDPKPMGJUB5HR/action/storage_attestation","attest_author":"https://pith.science/pith/35RSQAQJ6Y4E7GDPKPMGJUB5HR/action/author_attestation","sign_citation":"https://pith.science/pith/35RSQAQJ6Y4E7GDPKPMGJUB5HR/action/citation_signature","submit_replication":"https://pith.science/pith/35RSQAQJ6Y4E7GDPKPMGJUB5HR/action/replication_record"}},"created_at":"2026-05-18T03:07:11.784506+00:00","updated_at":"2026-05-18T03:07:11.784506+00:00"}