{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:HEX2SJJ3EH6XZS3IAB4WRYX4DD","short_pith_number":"pith:HEX2SJJ3","schema_version":"1.0","canonical_sha256":"392fa9253b21fd7ccb68007968e2fc18f2bb0079cb71b19f00cf9ac38ac6784e","source":{"kind":"arxiv","id":"1907.08450","version":1},"attestation_state":"computed","paper":{"title":"The sandpile group of a polygon flower","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bojan Mohar, Haiyan Chen","submitted_at":"2019-07-19T10:32:33Z","abstract_excerpt":"Let $C_t$ be a cycle of length $t$, and let $P_1,\\ldots,P_t$ be $t$ polygon chains. A polygon flower $F=(C_t; P_1,\\ldots,P_t)$ is a graph obtained by identifying the $i$th edge of $C_t$ with an edge $e_i$ that belongs to an end-polygon of $P_i$ for $i=1,\\ldots,t$. In this paper, we first give an explicit formula for the sandpile group $S(F)$ of $F$, which shows that the structure of $S(F)$ only depends on the numbers of spanning trees of $P_i$ and $P_i/ e_i$, $i=1,\\ldots,t$. By analyzing the arithmetic properties of those numbers, we give a simple formula for the minimum number of generators o"},"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":"1907.08450","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-07-19T10:32:33Z","cross_cats_sorted":[],"title_canon_sha256":"c620485c78e7ede09a8fc654d1db4c34b101c9bb3a632606cb360afe664c44d8","abstract_canon_sha256":"a2608881bdd985d3f41e12ac70bcc68ae005c15e3839bc577e206a92c114766c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:40:09.793010Z","signature_b64":"YEQgLOxPMAEM0g2X09a8LvnPBOD621mwr6FE74Db2Hi/pTcLIDHwh1BTBV6ZksylyRu2ERDPbUsPgK1x5gvADg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"392fa9253b21fd7ccb68007968e2fc18f2bb0079cb71b19f00cf9ac38ac6784e","last_reissued_at":"2026-05-17T23:40:09.792343Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:40:09.792343Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The sandpile group of a polygon flower","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bojan Mohar, Haiyan Chen","submitted_at":"2019-07-19T10:32:33Z","abstract_excerpt":"Let $C_t$ be a cycle of length $t$, and let $P_1,\\ldots,P_t$ be $t$ polygon chains. A polygon flower $F=(C_t; P_1,\\ldots,P_t)$ is a graph obtained by identifying the $i$th edge of $C_t$ with an edge $e_i$ that belongs to an end-polygon of $P_i$ for $i=1,\\ldots,t$. In this paper, we first give an explicit formula for the sandpile group $S(F)$ of $F$, which shows that the structure of $S(F)$ only depends on the numbers of spanning trees of $P_i$ and $P_i/ e_i$, $i=1,\\ldots,t$. By analyzing the arithmetic properties of those numbers, we give a simple formula for the minimum number of generators o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.08450","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":"1907.08450","created_at":"2026-05-17T23:40:09.792470+00:00"},{"alias_kind":"arxiv_version","alias_value":"1907.08450v1","created_at":"2026-05-17T23:40:09.792470+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.08450","created_at":"2026-05-17T23:40:09.792470+00:00"},{"alias_kind":"pith_short_12","alias_value":"HEX2SJJ3EH6X","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_16","alias_value":"HEX2SJJ3EH6XZS3I","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_8","alias_value":"HEX2SJJ3","created_at":"2026-05-18T12:33:18.533446+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/HEX2SJJ3EH6XZS3IAB4WRYX4DD","json":"https://pith.science/pith/HEX2SJJ3EH6XZS3IAB4WRYX4DD.json","graph_json":"https://pith.science/api/pith-number/HEX2SJJ3EH6XZS3IAB4WRYX4DD/graph.json","events_json":"https://pith.science/api/pith-number/HEX2SJJ3EH6XZS3IAB4WRYX4DD/events.json","paper":"https://pith.science/paper/HEX2SJJ3"},"agent_actions":{"view_html":"https://pith.science/pith/HEX2SJJ3EH6XZS3IAB4WRYX4DD","download_json":"https://pith.science/pith/HEX2SJJ3EH6XZS3IAB4WRYX4DD.json","view_paper":"https://pith.science/paper/HEX2SJJ3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1907.08450&json=true","fetch_graph":"https://pith.science/api/pith-number/HEX2SJJ3EH6XZS3IAB4WRYX4DD/graph.json","fetch_events":"https://pith.science/api/pith-number/HEX2SJJ3EH6XZS3IAB4WRYX4DD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HEX2SJJ3EH6XZS3IAB4WRYX4DD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HEX2SJJ3EH6XZS3IAB4WRYX4DD/action/storage_attestation","attest_author":"https://pith.science/pith/HEX2SJJ3EH6XZS3IAB4WRYX4DD/action/author_attestation","sign_citation":"https://pith.science/pith/HEX2SJJ3EH6XZS3IAB4WRYX4DD/action/citation_signature","submit_replication":"https://pith.science/pith/HEX2SJJ3EH6XZS3IAB4WRYX4DD/action/replication_record"}},"created_at":"2026-05-17T23:40:09.792470+00:00","updated_at":"2026-05-17T23:40:09.792470+00:00"}