{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:JPAXMDBSTDTJ2RTUOLNPLVMLTA","short_pith_number":"pith:JPAXMDBS","schema_version":"1.0","canonical_sha256":"4bc1760c3298e69d467472daf5d58b9813dd1abf2bca4b00a37a8aba7132ceb7","source":{"kind":"arxiv","id":"1702.04177","version":2},"attestation_state":"computed","paper":{"title":"Enumeration of Carlitz Multipermutations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alexis Martin, Henrik Eriksson","submitted_at":"2017-02-14T12:28:12Z","abstract_excerpt":"A multipermutation with $k$ copies each of $1\\ldots n$ is Carlitz if neighbours are different. We enumerate these objects for $k=2,3,4$ and derive recurrences. In particular, we prove and improve a conjectured recurrence for $k=3$, stated in OEIS, the Online Encyclopedia of Integer Sequences."},"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":"1702.04177","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-02-14T12:28:12Z","cross_cats_sorted":[],"title_canon_sha256":"5368a56dadd5c21f9e953b04f6770e90b4fbb0153c5ed5538f906e0be1f640ff","abstract_canon_sha256":"7fe82f96c14e48fb85b96604590447065ef142dd7660701606a02beca924d861"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:50:34.948516Z","signature_b64":"PZux0Z8DTOB/BWqE0o++A1Rm78wDNaxwxiwL12/lAwYPTSsrYm5yopDPHFTwZ3DrQev78mCuIIBV8cZfyGdXBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4bc1760c3298e69d467472daf5d58b9813dd1abf2bca4b00a37a8aba7132ceb7","last_reissued_at":"2026-05-18T00:50:34.947885Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:50:34.947885Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Enumeration of Carlitz Multipermutations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alexis Martin, Henrik Eriksson","submitted_at":"2017-02-14T12:28:12Z","abstract_excerpt":"A multipermutation with $k$ copies each of $1\\ldots n$ is Carlitz if neighbours are different. We enumerate these objects for $k=2,3,4$ and derive recurrences. In particular, we prove and improve a conjectured recurrence for $k=3$, stated in OEIS, the Online Encyclopedia of Integer Sequences."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.04177","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":"1702.04177","created_at":"2026-05-18T00:50:34.947983+00:00"},{"alias_kind":"arxiv_version","alias_value":"1702.04177v2","created_at":"2026-05-18T00:50:34.947983+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.04177","created_at":"2026-05-18T00:50:34.947983+00:00"},{"alias_kind":"pith_short_12","alias_value":"JPAXMDBSTDTJ","created_at":"2026-05-18T12:31:24.725408+00:00"},{"alias_kind":"pith_short_16","alias_value":"JPAXMDBSTDTJ2RTU","created_at":"2026-05-18T12:31:24.725408+00:00"},{"alias_kind":"pith_short_8","alias_value":"JPAXMDBS","created_at":"2026-05-18T12:31:24.725408+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/JPAXMDBSTDTJ2RTUOLNPLVMLTA","json":"https://pith.science/pith/JPAXMDBSTDTJ2RTUOLNPLVMLTA.json","graph_json":"https://pith.science/api/pith-number/JPAXMDBSTDTJ2RTUOLNPLVMLTA/graph.json","events_json":"https://pith.science/api/pith-number/JPAXMDBSTDTJ2RTUOLNPLVMLTA/events.json","paper":"https://pith.science/paper/JPAXMDBS"},"agent_actions":{"view_html":"https://pith.science/pith/JPAXMDBSTDTJ2RTUOLNPLVMLTA","download_json":"https://pith.science/pith/JPAXMDBSTDTJ2RTUOLNPLVMLTA.json","view_paper":"https://pith.science/paper/JPAXMDBS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1702.04177&json=true","fetch_graph":"https://pith.science/api/pith-number/JPAXMDBSTDTJ2RTUOLNPLVMLTA/graph.json","fetch_events":"https://pith.science/api/pith-number/JPAXMDBSTDTJ2RTUOLNPLVMLTA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JPAXMDBSTDTJ2RTUOLNPLVMLTA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JPAXMDBSTDTJ2RTUOLNPLVMLTA/action/storage_attestation","attest_author":"https://pith.science/pith/JPAXMDBSTDTJ2RTUOLNPLVMLTA/action/author_attestation","sign_citation":"https://pith.science/pith/JPAXMDBSTDTJ2RTUOLNPLVMLTA/action/citation_signature","submit_replication":"https://pith.science/pith/JPAXMDBSTDTJ2RTUOLNPLVMLTA/action/replication_record"}},"created_at":"2026-05-18T00:50:34.947983+00:00","updated_at":"2026-05-18T00:50:34.947983+00:00"}