{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:RPALQFQWH3K62W6S4JVVQUTRLF","short_pith_number":"pith:RPALQFQW","schema_version":"1.0","canonical_sha256":"8bc0b816163ed5ed5bd2e26b5852715963e81212415e37e6f8337ac817a58881","source":{"kind":"arxiv","id":"1504.05939","version":1},"attestation_state":"computed","paper":{"title":"Cyclic Critical Groups of Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Darren Glass, Ryan Becker","submitted_at":"2015-04-22T19:45:32Z","abstract_excerpt":"In this note, we describe a construction that leads to families of graphs whose critical groups are cyclic. For some of these families we are able to give a formula for the number of spanning trees of the graph, which then determines the group exactly. We also pose several open questions related to this work."},"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":"1504.05939","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-04-22T19:45:32Z","cross_cats_sorted":[],"title_canon_sha256":"b05e8c365c02ffc8394fdc452727472552985a7a409d359616370bf29ed16c7e","abstract_canon_sha256":"269c293ac3e9348a2b67922bb716de07d5ad5e5bdfa4d69b1f57c74a604ca1e9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:18:04.666282Z","signature_b64":"s3JroYNS9w3Hd3XYdJVG4DDw2gGCAIW3BGMpEMLnXp9Dug2/yZZE6nMnoWqgCjvQgTc2osGqAzQDNXCcOT1TDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8bc0b816163ed5ed5bd2e26b5852715963e81212415e37e6f8337ac817a58881","last_reissued_at":"2026-05-18T02:18:04.665544Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:18:04.665544Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Cyclic Critical Groups of Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Darren Glass, Ryan Becker","submitted_at":"2015-04-22T19:45:32Z","abstract_excerpt":"In this note, we describe a construction that leads to families of graphs whose critical groups are cyclic. For some of these families we are able to give a formula for the number of spanning trees of the graph, which then determines the group exactly. We also pose several open questions related to this work."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.05939","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":"1504.05939","created_at":"2026-05-18T02:18:04.665663+00:00"},{"alias_kind":"arxiv_version","alias_value":"1504.05939v1","created_at":"2026-05-18T02:18:04.665663+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.05939","created_at":"2026-05-18T02:18:04.665663+00:00"},{"alias_kind":"pith_short_12","alias_value":"RPALQFQWH3K6","created_at":"2026-05-18T12:29:39.896362+00:00"},{"alias_kind":"pith_short_16","alias_value":"RPALQFQWH3K62W6S","created_at":"2026-05-18T12:29:39.896362+00:00"},{"alias_kind":"pith_short_8","alias_value":"RPALQFQW","created_at":"2026-05-18T12:29:39.896362+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/RPALQFQWH3K62W6S4JVVQUTRLF","json":"https://pith.science/pith/RPALQFQWH3K62W6S4JVVQUTRLF.json","graph_json":"https://pith.science/api/pith-number/RPALQFQWH3K62W6S4JVVQUTRLF/graph.json","events_json":"https://pith.science/api/pith-number/RPALQFQWH3K62W6S4JVVQUTRLF/events.json","paper":"https://pith.science/paper/RPALQFQW"},"agent_actions":{"view_html":"https://pith.science/pith/RPALQFQWH3K62W6S4JVVQUTRLF","download_json":"https://pith.science/pith/RPALQFQWH3K62W6S4JVVQUTRLF.json","view_paper":"https://pith.science/paper/RPALQFQW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1504.05939&json=true","fetch_graph":"https://pith.science/api/pith-number/RPALQFQWH3K62W6S4JVVQUTRLF/graph.json","fetch_events":"https://pith.science/api/pith-number/RPALQFQWH3K62W6S4JVVQUTRLF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RPALQFQWH3K62W6S4JVVQUTRLF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RPALQFQWH3K62W6S4JVVQUTRLF/action/storage_attestation","attest_author":"https://pith.science/pith/RPALQFQWH3K62W6S4JVVQUTRLF/action/author_attestation","sign_citation":"https://pith.science/pith/RPALQFQWH3K62W6S4JVVQUTRLF/action/citation_signature","submit_replication":"https://pith.science/pith/RPALQFQWH3K62W6S4JVVQUTRLF/action/replication_record"}},"created_at":"2026-05-18T02:18:04.665663+00:00","updated_at":"2026-05-18T02:18:04.665663+00:00"}