{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:2S4CUVMWY3H6WHEZ3IRXHCZHL5","short_pith_number":"pith:2S4CUVMW","schema_version":"1.0","canonical_sha256":"d4b82a5596c6cfeb1c99da23738b275f43fdc0d3d1ab52b1c3b01c43ba33a9a6","source":{"kind":"arxiv","id":"1312.3848","version":1},"attestation_state":"computed","paper":{"title":"M\\\"obius Polynomials","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Will Murray","submitted_at":"2013-12-13T15:58:48Z","abstract_excerpt":"We introduce the M\\\"obius polynomial $ M_n(x) = \\sum_{d|n} \\mu\\left( \\frac nd \\right) x^d $, which gives the number of aperiodic bracelets of length $n$ with $x$ possible types of gems, and therefore satisfies $M_n(x) \\equiv 0$ (mod $n$) for all $x \\in \\mathbb Z$. We derive some key properties, analyze graphs in the complex plane, and then apply M\\\"obius polynomials combinatorially to juggling patterns, irreducible polynomials over finite fields, and Euler's totient theorem."},"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":"1312.3848","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-12-13T15:58:48Z","cross_cats_sorted":[],"title_canon_sha256":"5cfe05cc71713201f31c6b749c89f06e55eeb4efa95f6a3fe44cc110d2f6e9e6","abstract_canon_sha256":"c6ee7cbdc44f3ecb0f37fcfd6519e8ff5668769e902dbe16b5fa7e7820e769a7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:04:47.398257Z","signature_b64":"kCRaUFEj+VhErPJ4DJb4jl27zIqpkGA1ZzkzwUMgoL0IHnigkqxYSPgRgcUP/GubtaezTDzg7Fa5fCuNRDUhDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d4b82a5596c6cfeb1c99da23738b275f43fdc0d3d1ab52b1c3b01c43ba33a9a6","last_reissued_at":"2026-05-18T03:04:47.397477Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:04:47.397477Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"M\\\"obius Polynomials","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Will Murray","submitted_at":"2013-12-13T15:58:48Z","abstract_excerpt":"We introduce the M\\\"obius polynomial $ M_n(x) = \\sum_{d|n} \\mu\\left( \\frac nd \\right) x^d $, which gives the number of aperiodic bracelets of length $n$ with $x$ possible types of gems, and therefore satisfies $M_n(x) \\equiv 0$ (mod $n$) for all $x \\in \\mathbb Z$. We derive some key properties, analyze graphs in the complex plane, and then apply M\\\"obius polynomials combinatorially to juggling patterns, irreducible polynomials over finite fields, and Euler's totient theorem."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.3848","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":"1312.3848","created_at":"2026-05-18T03:04:47.397613+00:00"},{"alias_kind":"arxiv_version","alias_value":"1312.3848v1","created_at":"2026-05-18T03:04:47.397613+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.3848","created_at":"2026-05-18T03:04:47.397613+00:00"},{"alias_kind":"pith_short_12","alias_value":"2S4CUVMWY3H6","created_at":"2026-05-18T12:27:32.513160+00:00"},{"alias_kind":"pith_short_16","alias_value":"2S4CUVMWY3H6WHEZ","created_at":"2026-05-18T12:27:32.513160+00:00"},{"alias_kind":"pith_short_8","alias_value":"2S4CUVMW","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/2S4CUVMWY3H6WHEZ3IRXHCZHL5","json":"https://pith.science/pith/2S4CUVMWY3H6WHEZ3IRXHCZHL5.json","graph_json":"https://pith.science/api/pith-number/2S4CUVMWY3H6WHEZ3IRXHCZHL5/graph.json","events_json":"https://pith.science/api/pith-number/2S4CUVMWY3H6WHEZ3IRXHCZHL5/events.json","paper":"https://pith.science/paper/2S4CUVMW"},"agent_actions":{"view_html":"https://pith.science/pith/2S4CUVMWY3H6WHEZ3IRXHCZHL5","download_json":"https://pith.science/pith/2S4CUVMWY3H6WHEZ3IRXHCZHL5.json","view_paper":"https://pith.science/paper/2S4CUVMW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1312.3848&json=true","fetch_graph":"https://pith.science/api/pith-number/2S4CUVMWY3H6WHEZ3IRXHCZHL5/graph.json","fetch_events":"https://pith.science/api/pith-number/2S4CUVMWY3H6WHEZ3IRXHCZHL5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2S4CUVMWY3H6WHEZ3IRXHCZHL5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2S4CUVMWY3H6WHEZ3IRXHCZHL5/action/storage_attestation","attest_author":"https://pith.science/pith/2S4CUVMWY3H6WHEZ3IRXHCZHL5/action/author_attestation","sign_citation":"https://pith.science/pith/2S4CUVMWY3H6WHEZ3IRXHCZHL5/action/citation_signature","submit_replication":"https://pith.science/pith/2S4CUVMWY3H6WHEZ3IRXHCZHL5/action/replication_record"}},"created_at":"2026-05-18T03:04:47.397613+00:00","updated_at":"2026-05-18T03:04:47.397613+00:00"}