{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:HEX2SJJ3EH6XZS3IAB4WRYX4DD","short_pith_number":"pith:HEX2SJJ3","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"},"canonical_sha256":"392fa9253b21fd7ccb68007968e2fc18f2bb0079cb71b19f00cf9ac38ac6784e","source":{"kind":"arxiv","id":"1907.08450","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.08450","created_at":"2026-05-17T23:40:09Z"},{"alias_kind":"arxiv_version","alias_value":"1907.08450v1","created_at":"2026-05-17T23:40:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.08450","created_at":"2026-05-17T23:40:09Z"},{"alias_kind":"pith_short_12","alias_value":"HEX2SJJ3EH6X","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"HEX2SJJ3EH6XZS3I","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"HEX2SJJ3","created_at":"2026-05-18T12:33:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:HEX2SJJ3EH6XZS3IAB4WRYX4DD","target":"record","payload":{"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"},"canonical_sha256":"392fa9253b21fd7ccb68007968e2fc18f2bb0079cb71b19f00cf9ac38ac6784e","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"},"source_kind":"arxiv","source_id":"1907.08450","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:40:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KtdtCJJRRoko67QvOxZb4dt6D8K9M5MVvBkgfdCjuazJnD2kggm9cuoWC6N/05PbHa3JbsnXocN/H9mN4zX7AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T08:37:48.089176Z"},"content_sha256":"d9777b099d9f8cc6b7c9cd0653797348567d190fb32986d0625036f1e5395695","schema_version":"1.0","event_id":"sha256:d9777b099d9f8cc6b7c9cd0653797348567d190fb32986d0625036f1e5395695"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:HEX2SJJ3EH6XZS3IAB4WRYX4DD","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:40:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LLEGa6l6Dnbp0mbDy46rkRZlWPJYmUypcVAdLjxYkeNwr1wTP7qpQE6Vf1Bqr2W5hIFjOZGrkNEbnG32z1meBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T08:37:48.089532Z"},"content_sha256":"4c16b49b1b6bf16d65df287cc3d42102221952ac478af32429f2647573151dfb","schema_version":"1.0","event_id":"sha256:4c16b49b1b6bf16d65df287cc3d42102221952ac478af32429f2647573151dfb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HEX2SJJ3EH6XZS3IAB4WRYX4DD/bundle.json","state_url":"https://pith.science/pith/HEX2SJJ3EH6XZS3IAB4WRYX4DD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HEX2SJJ3EH6XZS3IAB4WRYX4DD/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-01T08:37:48Z","links":{"resolver":"https://pith.science/pith/HEX2SJJ3EH6XZS3IAB4WRYX4DD","bundle":"https://pith.science/pith/HEX2SJJ3EH6XZS3IAB4WRYX4DD/bundle.json","state":"https://pith.science/pith/HEX2SJJ3EH6XZS3IAB4WRYX4DD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HEX2SJJ3EH6XZS3IAB4WRYX4DD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:HEX2SJJ3EH6XZS3IAB4WRYX4DD","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"a2608881bdd985d3f41e12ac70bcc68ae005c15e3839bc577e206a92c114766c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-07-19T10:32:33Z","title_canon_sha256":"c620485c78e7ede09a8fc654d1db4c34b101c9bb3a632606cb360afe664c44d8"},"schema_version":"1.0","source":{"id":"1907.08450","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.08450","created_at":"2026-05-17T23:40:09Z"},{"alias_kind":"arxiv_version","alias_value":"1907.08450v1","created_at":"2026-05-17T23:40:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.08450","created_at":"2026-05-17T23:40:09Z"},{"alias_kind":"pith_short_12","alias_value":"HEX2SJJ3EH6X","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"HEX2SJJ3EH6XZS3I","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"HEX2SJJ3","created_at":"2026-05-18T12:33:18Z"}],"graph_snapshots":[{"event_id":"sha256:4c16b49b1b6bf16d65df287cc3d42102221952ac478af32429f2647573151dfb","target":"graph","created_at":"2026-05-17T23:40:09Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Bojan Mohar, Haiyan Chen","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-07-19T10:32:33Z","title":"The sandpile group of a polygon flower"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.08450","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:d9777b099d9f8cc6b7c9cd0653797348567d190fb32986d0625036f1e5395695","target":"record","created_at":"2026-05-17T23:40:09Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"a2608881bdd985d3f41e12ac70bcc68ae005c15e3839bc577e206a92c114766c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-07-19T10:32:33Z","title_canon_sha256":"c620485c78e7ede09a8fc654d1db4c34b101c9bb3a632606cb360afe664c44d8"},"schema_version":"1.0","source":{"id":"1907.08450","kind":"arxiv","version":1}},"canonical_sha256":"392fa9253b21fd7ccb68007968e2fc18f2bb0079cb71b19f00cf9ac38ac6784e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"392fa9253b21fd7ccb68007968e2fc18f2bb0079cb71b19f00cf9ac38ac6784e","first_computed_at":"2026-05-17T23:40:09.792343Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:40:09.792343Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YEQgLOxPMAEM0g2X09a8LvnPBOD621mwr6FE74Db2Hi/pTcLIDHwh1BTBV6ZksylyRu2ERDPbUsPgK1x5gvADg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:40:09.793010Z","signed_message":"canonical_sha256_bytes"},"source_id":"1907.08450","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d9777b099d9f8cc6b7c9cd0653797348567d190fb32986d0625036f1e5395695","sha256:4c16b49b1b6bf16d65df287cc3d42102221952ac478af32429f2647573151dfb"],"state_sha256":"c54b2a3951f933c574130d8508cadb4f8632ab2e5c536ae216392c2a4512b072"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/ih1hiWfP/y3+6kx8K2k7SmLXwNk2pnd/JGfzWGjFcqBB/UoAS/M7DexrzCtl4/wICG+haXj7jb+FpjMiyd5Dw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T08:37:48.091419Z","bundle_sha256":"93bb66999c412e3db026c68e3cd2d9c10db9d8b6cac3de72170784c7f12a33ac"}}