{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:PV7RKVICHUBWS6N7KUV5YMUGBT","short_pith_number":"pith:PV7RKVIC","schema_version":"1.0","canonical_sha256":"7d7f1555023d036979bf552bdc32860cd5baac9a615f8aaa3936f7a633f9f0f0","source":{"kind":"arxiv","id":"1501.01997","version":2},"attestation_state":"computed","paper":{"title":"The Twelvefold way, the non-intersecting circles problem, and partitions of multisets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Daniel Yaqubi, Madjid Mirzavaziri, Toufik Mansour","submitted_at":"2015-01-08T22:44:20Z","abstract_excerpt":"Let $n$ be a non-negative integer and $A=\\{a_1,\\ldots,a_k\\}$ be a multi-set with $k$ not necessarily distinct members, where $a_1\\leqslant\\ldots\\leqslant a_k$. We denote by $\\Delta(n,A)$ the number of ways to partition $n$ as the form $a_1x_1+\\ldots+a_kx_k$, where $x_i$'s are distinct positive integers and $x_i< x_{i+1}$ whenever $a_i=a_{i+1}$. We give a recursive formula for $\\Delta(n,A)$ and some explicit formulas for some special cases. Using this notion we solve the non-intersecting circles problem which asks to evaluate the number of ways to draw $n$ non-intersecting circles in a plane re"},"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":"1501.01997","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-01-08T22:44:20Z","cross_cats_sorted":[],"title_canon_sha256":"60efbc3c69370bd8f46b648a414ad577be13f06fc35c2aa467424dd1e49af44f","abstract_canon_sha256":"d704619d3c575fd2f17a452801e030f744ad76cb4c3f8f29c497b369e02adf94"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:15:38.298022Z","signature_b64":"2HimSBKewPTSRWq4yMISJXqg7SRABZzuo5/DDcldcOSyvWhf3u2JdRMRTsqwxwwd7KyVccZKCra+ZIUBwf99Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7d7f1555023d036979bf552bdc32860cd5baac9a615f8aaa3936f7a633f9f0f0","last_reissued_at":"2026-05-18T00:15:38.297434Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:15:38.297434Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Twelvefold way, the non-intersecting circles problem, and partitions of multisets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Daniel Yaqubi, Madjid Mirzavaziri, Toufik Mansour","submitted_at":"2015-01-08T22:44:20Z","abstract_excerpt":"Let $n$ be a non-negative integer and $A=\\{a_1,\\ldots,a_k\\}$ be a multi-set with $k$ not necessarily distinct members, where $a_1\\leqslant\\ldots\\leqslant a_k$. We denote by $\\Delta(n,A)$ the number of ways to partition $n$ as the form $a_1x_1+\\ldots+a_kx_k$, where $x_i$'s are distinct positive integers and $x_i< x_{i+1}$ whenever $a_i=a_{i+1}$. We give a recursive formula for $\\Delta(n,A)$ and some explicit formulas for some special cases. Using this notion we solve the non-intersecting circles problem which asks to evaluate the number of ways to draw $n$ non-intersecting circles in a plane re"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.01997","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":"1501.01997","created_at":"2026-05-18T00:15:38.297526+00:00"},{"alias_kind":"arxiv_version","alias_value":"1501.01997v2","created_at":"2026-05-18T00:15:38.297526+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.01997","created_at":"2026-05-18T00:15:38.297526+00:00"},{"alias_kind":"pith_short_12","alias_value":"PV7RKVICHUBW","created_at":"2026-05-18T12:29:37.295048+00:00"},{"alias_kind":"pith_short_16","alias_value":"PV7RKVICHUBWS6N7","created_at":"2026-05-18T12:29:37.295048+00:00"},{"alias_kind":"pith_short_8","alias_value":"PV7RKVIC","created_at":"2026-05-18T12:29:37.295048+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/PV7RKVICHUBWS6N7KUV5YMUGBT","json":"https://pith.science/pith/PV7RKVICHUBWS6N7KUV5YMUGBT.json","graph_json":"https://pith.science/api/pith-number/PV7RKVICHUBWS6N7KUV5YMUGBT/graph.json","events_json":"https://pith.science/api/pith-number/PV7RKVICHUBWS6N7KUV5YMUGBT/events.json","paper":"https://pith.science/paper/PV7RKVIC"},"agent_actions":{"view_html":"https://pith.science/pith/PV7RKVICHUBWS6N7KUV5YMUGBT","download_json":"https://pith.science/pith/PV7RKVICHUBWS6N7KUV5YMUGBT.json","view_paper":"https://pith.science/paper/PV7RKVIC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1501.01997&json=true","fetch_graph":"https://pith.science/api/pith-number/PV7RKVICHUBWS6N7KUV5YMUGBT/graph.json","fetch_events":"https://pith.science/api/pith-number/PV7RKVICHUBWS6N7KUV5YMUGBT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PV7RKVICHUBWS6N7KUV5YMUGBT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PV7RKVICHUBWS6N7KUV5YMUGBT/action/storage_attestation","attest_author":"https://pith.science/pith/PV7RKVICHUBWS6N7KUV5YMUGBT/action/author_attestation","sign_citation":"https://pith.science/pith/PV7RKVICHUBWS6N7KUV5YMUGBT/action/citation_signature","submit_replication":"https://pith.science/pith/PV7RKVICHUBWS6N7KUV5YMUGBT/action/replication_record"}},"created_at":"2026-05-18T00:15:38.297526+00:00","updated_at":"2026-05-18T00:15:38.297526+00:00"}