{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:SLSIGXFFG4X35GHOKZ2IMYWTQY","short_pith_number":"pith:SLSIGXFF","schema_version":"1.0","canonical_sha256":"92e4835ca5372fbe98ee56748662d38619c983830fd54ad3699436a4b1161451","source":{"kind":"arxiv","id":"1509.06093","version":1},"attestation_state":"computed","paper":{"title":"Chocolate Numbers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Angela Song, Caleb Ji, Robin Park, Tanya Khovanova","submitted_at":"2015-09-21T02:11:12Z","abstract_excerpt":"In this paper, we consider a game played on a rectangular $m \\times n$ gridded chocolate bar. Each move, a player breaks the bar along a grid line. Each move after that consists of taking any piece of chocolate and breaking it again along existing grid lines, until just $mn$ individual squares remain.\n  This paper enumerates the number of ways to break an $m \\times n$ bar, which we call chocolate numbers, and introduces four new sequences related to these numbers. Using various techniques, we prove interesting divisibility results regarding these 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":"1509.06093","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-09-21T02:11:12Z","cross_cats_sorted":[],"title_canon_sha256":"6d9ae528818b8206d230f215bf37edff8ece582aa7caf0c6bb8d587143145cd8","abstract_canon_sha256":"ee303bf63a128371f6ece57d1ce38ae88b0f846714b2edc7aae865c48611ee77"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:32:35.854703Z","signature_b64":"KrXTCGxzCkIX99ZLhwago2ZspsRiM0w8SUspnu4yK2AlL9T4zNtW9e/Ay62jDH0a8obcELp64p6mg27bCOGyAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"92e4835ca5372fbe98ee56748662d38619c983830fd54ad3699436a4b1161451","last_reissued_at":"2026-05-18T01:32:35.854323Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:32:35.854323Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Chocolate Numbers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Angela Song, Caleb Ji, Robin Park, Tanya Khovanova","submitted_at":"2015-09-21T02:11:12Z","abstract_excerpt":"In this paper, we consider a game played on a rectangular $m \\times n$ gridded chocolate bar. Each move, a player breaks the bar along a grid line. Each move after that consists of taking any piece of chocolate and breaking it again along existing grid lines, until just $mn$ individual squares remain.\n  This paper enumerates the number of ways to break an $m \\times n$ bar, which we call chocolate numbers, and introduces four new sequences related to these numbers. Using various techniques, we prove interesting divisibility results regarding these sequences."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.06093","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":"1509.06093","created_at":"2026-05-18T01:32:35.854385+00:00"},{"alias_kind":"arxiv_version","alias_value":"1509.06093v1","created_at":"2026-05-18T01:32:35.854385+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.06093","created_at":"2026-05-18T01:32:35.854385+00:00"},{"alias_kind":"pith_short_12","alias_value":"SLSIGXFFG4X3","created_at":"2026-05-18T12:29:42.218222+00:00"},{"alias_kind":"pith_short_16","alias_value":"SLSIGXFFG4X35GHO","created_at":"2026-05-18T12:29:42.218222+00:00"},{"alias_kind":"pith_short_8","alias_value":"SLSIGXFF","created_at":"2026-05-18T12:29:42.218222+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/SLSIGXFFG4X35GHOKZ2IMYWTQY","json":"https://pith.science/pith/SLSIGXFFG4X35GHOKZ2IMYWTQY.json","graph_json":"https://pith.science/api/pith-number/SLSIGXFFG4X35GHOKZ2IMYWTQY/graph.json","events_json":"https://pith.science/api/pith-number/SLSIGXFFG4X35GHOKZ2IMYWTQY/events.json","paper":"https://pith.science/paper/SLSIGXFF"},"agent_actions":{"view_html":"https://pith.science/pith/SLSIGXFFG4X35GHOKZ2IMYWTQY","download_json":"https://pith.science/pith/SLSIGXFFG4X35GHOKZ2IMYWTQY.json","view_paper":"https://pith.science/paper/SLSIGXFF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1509.06093&json=true","fetch_graph":"https://pith.science/api/pith-number/SLSIGXFFG4X35GHOKZ2IMYWTQY/graph.json","fetch_events":"https://pith.science/api/pith-number/SLSIGXFFG4X35GHOKZ2IMYWTQY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SLSIGXFFG4X35GHOKZ2IMYWTQY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SLSIGXFFG4X35GHOKZ2IMYWTQY/action/storage_attestation","attest_author":"https://pith.science/pith/SLSIGXFFG4X35GHOKZ2IMYWTQY/action/author_attestation","sign_citation":"https://pith.science/pith/SLSIGXFFG4X35GHOKZ2IMYWTQY/action/citation_signature","submit_replication":"https://pith.science/pith/SLSIGXFFG4X35GHOKZ2IMYWTQY/action/replication_record"}},"created_at":"2026-05-18T01:32:35.854385+00:00","updated_at":"2026-05-18T01:32:35.854385+00:00"}