{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:VQ7CHL6OHCR3453NSORUOF5UVC","short_pith_number":"pith:VQ7CHL6O","schema_version":"1.0","canonical_sha256":"ac3e23afce38a3be776d93a34717b4a8b8bf3a7ea7d90873017d92072b9c1fe6","source":{"kind":"arxiv","id":"1508.05296","version":2},"attestation_state":"computed","paper":{"title":"Counting prime juggling patterns","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Christopher Cox, Esther Banaian, Jacob Landgraf, Jeffrey Davis, Scarlitte Ponce, Steve Butler","submitted_at":"2015-08-21T15:00:34Z","abstract_excerpt":"Juggling patterns can be described by a closed walk in a (directed) state graph, where each vertex (or state) is a landing pattern for the balls and directed edges connect states that can occur consecutively. The number of such patterns of length $n$ is well known, but a long-standing problem is to count the number of prime juggling patterns (those juggling patterns corresponding to cycles in the state graph). For the case of $b=2$ balls we give an expression for the number of prime juggling patterns of length $n$ by establishing a connection with partitions of $n$ into distinct parts. From th"},"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":"1508.05296","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-08-21T15:00:34Z","cross_cats_sorted":[],"title_canon_sha256":"dde44f5f41b4c0ba4d81b19f9e1fab4cf5f865ed000633a783972ac7921efe58","abstract_canon_sha256":"1b3837db9620a89ed351d2740446d2d216087dfee744b47398aae86ff6fca8be"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:27:00.067075Z","signature_b64":"Zi2FFilUMh+xUF6MZUNh5W0zV0JEvejMO1ZLsCMu4dj34naZfVw0w1bPz88y3BjvZsCF8PyC4gtUSwRjO2YOAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ac3e23afce38a3be776d93a34717b4a8b8bf3a7ea7d90873017d92072b9c1fe6","last_reissued_at":"2026-05-18T01:27:00.066440Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:27:00.066440Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Counting prime juggling patterns","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Christopher Cox, Esther Banaian, Jacob Landgraf, Jeffrey Davis, Scarlitte Ponce, Steve Butler","submitted_at":"2015-08-21T15:00:34Z","abstract_excerpt":"Juggling patterns can be described by a closed walk in a (directed) state graph, where each vertex (or state) is a landing pattern for the balls and directed edges connect states that can occur consecutively. The number of such patterns of length $n$ is well known, but a long-standing problem is to count the number of prime juggling patterns (those juggling patterns corresponding to cycles in the state graph). For the case of $b=2$ balls we give an expression for the number of prime juggling patterns of length $n$ by establishing a connection with partitions of $n$ into distinct parts. From th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.05296","kind":"arxiv","version":2},"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":"1508.05296","created_at":"2026-05-18T01:27:00.066530+00:00"},{"alias_kind":"arxiv_version","alias_value":"1508.05296v2","created_at":"2026-05-18T01:27:00.066530+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.05296","created_at":"2026-05-18T01:27:00.066530+00:00"},{"alias_kind":"pith_short_12","alias_value":"VQ7CHL6OHCR3","created_at":"2026-05-18T12:29:47.479230+00:00"},{"alias_kind":"pith_short_16","alias_value":"VQ7CHL6OHCR3453N","created_at":"2026-05-18T12:29:47.479230+00:00"},{"alias_kind":"pith_short_8","alias_value":"VQ7CHL6O","created_at":"2026-05-18T12:29:47.479230+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/VQ7CHL6OHCR3453NSORUOF5UVC","json":"https://pith.science/pith/VQ7CHL6OHCR3453NSORUOF5UVC.json","graph_json":"https://pith.science/api/pith-number/VQ7CHL6OHCR3453NSORUOF5UVC/graph.json","events_json":"https://pith.science/api/pith-number/VQ7CHL6OHCR3453NSORUOF5UVC/events.json","paper":"https://pith.science/paper/VQ7CHL6O"},"agent_actions":{"view_html":"https://pith.science/pith/VQ7CHL6OHCR3453NSORUOF5UVC","download_json":"https://pith.science/pith/VQ7CHL6OHCR3453NSORUOF5UVC.json","view_paper":"https://pith.science/paper/VQ7CHL6O","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1508.05296&json=true","fetch_graph":"https://pith.science/api/pith-number/VQ7CHL6OHCR3453NSORUOF5UVC/graph.json","fetch_events":"https://pith.science/api/pith-number/VQ7CHL6OHCR3453NSORUOF5UVC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VQ7CHL6OHCR3453NSORUOF5UVC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VQ7CHL6OHCR3453NSORUOF5UVC/action/storage_attestation","attest_author":"https://pith.science/pith/VQ7CHL6OHCR3453NSORUOF5UVC/action/author_attestation","sign_citation":"https://pith.science/pith/VQ7CHL6OHCR3453NSORUOF5UVC/action/citation_signature","submit_replication":"https://pith.science/pith/VQ7CHL6OHCR3453NSORUOF5UVC/action/replication_record"}},"created_at":"2026-05-18T01:27:00.066530+00:00","updated_at":"2026-05-18T01:27:00.066530+00:00"}