{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:VKAMNMLYGRPRL2KSMQJN4SLROE","short_pith_number":"pith:VKAMNMLY","schema_version":"1.0","canonical_sha256":"aa80c6b178345f15e9526412de49717118a35b5a01d7b7cdc1a6ec91197a1210","source":{"kind":"arxiv","id":"1801.09516","version":1},"attestation_state":"computed","paper":{"title":"A Pascal-like Bound for the Number of Necklaces with Fixed Density","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.QA"],"primary_cat":"math.CO","authors_text":"I. Heckenberger, J. Sawada","submitted_at":"2018-01-29T14:13:33Z","abstract_excerpt":"A bound resembling Pascal's identity is presented for binary necklaces with fixed density using Lyndon words with fixed density. The result is generalized to k-ary necklaces and Lyndon words with fixed content. The bound arises in the study of Nichols algebras of diagonal type."},"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":"1801.09516","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-01-29T14:13:33Z","cross_cats_sorted":["math.QA"],"title_canon_sha256":"52c3958ce5a2de508d83c620619eca1cd0ab22cb0dc2340d769dffad56378607","abstract_canon_sha256":"e2d4d2a798bfe46ca4c674a4a13ad98a72a545c87524b9d3c8109e1b569e5f3b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:24:57.192051Z","signature_b64":"M+fSuTzhkcL2Bmi3MAZhxJnCHdiAuhv3FgCaeY7lW7UlI9YO9e3eCBPzv8IzwkFDFFnDdp+x266uPqrSW04BDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"aa80c6b178345f15e9526412de49717118a35b5a01d7b7cdc1a6ec91197a1210","last_reissued_at":"2026-05-18T00:24:57.191457Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:24:57.191457Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Pascal-like Bound for the Number of Necklaces with Fixed Density","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.QA"],"primary_cat":"math.CO","authors_text":"I. Heckenberger, J. Sawada","submitted_at":"2018-01-29T14:13:33Z","abstract_excerpt":"A bound resembling Pascal's identity is presented for binary necklaces with fixed density using Lyndon words with fixed density. The result is generalized to k-ary necklaces and Lyndon words with fixed content. The bound arises in the study of Nichols algebras of diagonal type."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.09516","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":"1801.09516","created_at":"2026-05-18T00:24:57.191542+00:00"},{"alias_kind":"arxiv_version","alias_value":"1801.09516v1","created_at":"2026-05-18T00:24:57.191542+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.09516","created_at":"2026-05-18T00:24:57.191542+00:00"},{"alias_kind":"pith_short_12","alias_value":"VKAMNMLYGRPR","created_at":"2026-05-18T12:32:59.047623+00:00"},{"alias_kind":"pith_short_16","alias_value":"VKAMNMLYGRPRL2KS","created_at":"2026-05-18T12:32:59.047623+00:00"},{"alias_kind":"pith_short_8","alias_value":"VKAMNMLY","created_at":"2026-05-18T12:32:59.047623+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/VKAMNMLYGRPRL2KSMQJN4SLROE","json":"https://pith.science/pith/VKAMNMLYGRPRL2KSMQJN4SLROE.json","graph_json":"https://pith.science/api/pith-number/VKAMNMLYGRPRL2KSMQJN4SLROE/graph.json","events_json":"https://pith.science/api/pith-number/VKAMNMLYGRPRL2KSMQJN4SLROE/events.json","paper":"https://pith.science/paper/VKAMNMLY"},"agent_actions":{"view_html":"https://pith.science/pith/VKAMNMLYGRPRL2KSMQJN4SLROE","download_json":"https://pith.science/pith/VKAMNMLYGRPRL2KSMQJN4SLROE.json","view_paper":"https://pith.science/paper/VKAMNMLY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1801.09516&json=true","fetch_graph":"https://pith.science/api/pith-number/VKAMNMLYGRPRL2KSMQJN4SLROE/graph.json","fetch_events":"https://pith.science/api/pith-number/VKAMNMLYGRPRL2KSMQJN4SLROE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VKAMNMLYGRPRL2KSMQJN4SLROE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VKAMNMLYGRPRL2KSMQJN4SLROE/action/storage_attestation","attest_author":"https://pith.science/pith/VKAMNMLYGRPRL2KSMQJN4SLROE/action/author_attestation","sign_citation":"https://pith.science/pith/VKAMNMLYGRPRL2KSMQJN4SLROE/action/citation_signature","submit_replication":"https://pith.science/pith/VKAMNMLYGRPRL2KSMQJN4SLROE/action/replication_record"}},"created_at":"2026-05-18T00:24:57.191542+00:00","updated_at":"2026-05-18T00:24:57.191542+00:00"}