{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:35RSQAQJ6Y4E7GDPKPMGJUB5HR","short_pith_number":"pith:35RSQAQJ","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"},"canonical_sha256":"df63280209f6384f986f53d864d03d3c74f7d49b2e290243c6bbf4062cec8168","source":{"kind":"arxiv","id":"1311.3332","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1311.3332","created_at":"2026-05-18T03:07:11Z"},{"alias_kind":"arxiv_version","alias_value":"1311.3332v1","created_at":"2026-05-18T03:07:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.3332","created_at":"2026-05-18T03:07:11Z"},{"alias_kind":"pith_short_12","alias_value":"35RSQAQJ6Y4E","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_16","alias_value":"35RSQAQJ6Y4E7GDP","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_8","alias_value":"35RSQAQJ","created_at":"2026-05-18T12:27:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:35RSQAQJ6Y4E7GDPKPMGJUB5HR","target":"record","payload":{"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"},"canonical_sha256":"df63280209f6384f986f53d864d03d3c74f7d49b2e290243c6bbf4062cec8168","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"},"source_kind":"arxiv","source_id":"1311.3332","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-05-18T03:07:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Y9IOCWtzW0YI2HSqBrwhJN/K6eg9bYWia/jzu8rdlr5fva9OhS7LYI7HwmGvBMEKiAoFE2Pppr3OjaSrcqt6Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T03:13:23.678466Z"},"content_sha256":"53ce2da15b5f3b7e7e3eca3336ad85898750310a18e28828baff96086ad25f33","schema_version":"1.0","event_id":"sha256:53ce2da15b5f3b7e7e3eca3336ad85898750310a18e28828baff96086ad25f33"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:35RSQAQJ6Y4E7GDPKPMGJUB5HR","target":"graph","payload":{"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"},"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:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Yq6MFcmoqLiRa2J7KqqINrG/Aa8/IHqK8aLYFCUD9HFbZGjXcfJPM8v9lCTCqI99HHGzk3Pb14g5MJ9zy+HOCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T03:13:23.678801Z"},"content_sha256":"aedfa7716e12b92ed58175844979a4a313bed243e0a9b1580facacc63a0feaef","schema_version":"1.0","event_id":"sha256:aedfa7716e12b92ed58175844979a4a313bed243e0a9b1580facacc63a0feaef"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/35RSQAQJ6Y4E7GDPKPMGJUB5HR/bundle.json","state_url":"https://pith.science/pith/35RSQAQJ6Y4E7GDPKPMGJUB5HR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/35RSQAQJ6Y4E7GDPKPMGJUB5HR/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-29T03:13:23Z","links":{"resolver":"https://pith.science/pith/35RSQAQJ6Y4E7GDPKPMGJUB5HR","bundle":"https://pith.science/pith/35RSQAQJ6Y4E7GDPKPMGJUB5HR/bundle.json","state":"https://pith.science/pith/35RSQAQJ6Y4E7GDPKPMGJUB5HR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/35RSQAQJ6Y4E7GDPKPMGJUB5HR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:35RSQAQJ6Y4E7GDPKPMGJUB5HR","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":"71119af34ded8df27d9399a069864ec135fa436aa6d4548d2e25c5bb51fdb72a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-11-13T22:56:41Z","title_canon_sha256":"09091924fbd65290a2c4b7025133b6ad89b6910bacfca4aff260ffe4f15e6039"},"schema_version":"1.0","source":{"id":"1311.3332","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1311.3332","created_at":"2026-05-18T03:07:11Z"},{"alias_kind":"arxiv_version","alias_value":"1311.3332v1","created_at":"2026-05-18T03:07:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.3332","created_at":"2026-05-18T03:07:11Z"},{"alias_kind":"pith_short_12","alias_value":"35RSQAQJ6Y4E","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_16","alias_value":"35RSQAQJ6Y4E7GDP","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_8","alias_value":"35RSQAQJ","created_at":"2026-05-18T12:27:32Z"}],"graph_snapshots":[{"event_id":"sha256:aedfa7716e12b92ed58175844979a4a313bed243e0a9b1580facacc63a0feaef","target":"graph","created_at":"2026-05-18T03:07:11Z","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":"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","authors_text":"Jeffrey Remmel, Miles Jones, Sergey Kitaev","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-11-13T22:56:41Z","title":"Frame patterns in n-cycles"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.3332","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:53ce2da15b5f3b7e7e3eca3336ad85898750310a18e28828baff96086ad25f33","target":"record","created_at":"2026-05-18T03:07:11Z","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":"71119af34ded8df27d9399a069864ec135fa436aa6d4548d2e25c5bb51fdb72a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-11-13T22:56:41Z","title_canon_sha256":"09091924fbd65290a2c4b7025133b6ad89b6910bacfca4aff260ffe4f15e6039"},"schema_version":"1.0","source":{"id":"1311.3332","kind":"arxiv","version":1}},"canonical_sha256":"df63280209f6384f986f53d864d03d3c74f7d49b2e290243c6bbf4062cec8168","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"df63280209f6384f986f53d864d03d3c74f7d49b2e290243c6bbf4062cec8168","first_computed_at":"2026-05-18T03:07:11.784397Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:07:11.784397Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"JFYENCqphg2G4rKLUwvxri/cyvw5NDirsvi450byawrTLc+MQMzXdk24ZrGTAeVN960KSy+UO881jLReKM1YCA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:07:11.785176Z","signed_message":"canonical_sha256_bytes"},"source_id":"1311.3332","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:53ce2da15b5f3b7e7e3eca3336ad85898750310a18e28828baff96086ad25f33","sha256:aedfa7716e12b92ed58175844979a4a313bed243e0a9b1580facacc63a0feaef"],"state_sha256":"d0108e61b3e8b9330f906be056c57abf7a2a36dd658d5f2383c1728b78e637c3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3HcKmPd24RhPGrChMyjxZJW3YKSml0MdY+MF8+bt/2H42mXx/DDiHeQrQkLGVK41Wpw7U+bIaUcLcu4IM+iyDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-29T03:13:23.680676Z","bundle_sha256":"2c3faeb44cf2f658bb1cb0a82661f74eb80accbe5bc467e177ea51f309050fb0"}}