{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:HEIGTTVEHAVMCRARRNRS5W6W36","short_pith_number":"pith:HEIGTTVE","schema_version":"1.0","canonical_sha256":"391069cea4382ac144118b632edbd6dfb235e23a4e0b10f62d7855aa11d69460","source":{"kind":"arxiv","id":"2505.22941","version":2},"attestation_state":"computed","paper":{"title":"The only Class 0 Flower snark is the smallest","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Andr\\'e Luis Alves Martins, Celina Miraglia Herrera de Figueiredo, Franklin de Lima Marquezino, Guilherme Adamatti Bridi","submitted_at":"2025-05-28T23:45:27Z","abstract_excerpt":"Graph pebbling is a game played on graphs with pebbles on their vertices. A pebbling move removes two pebbles from one vertex and places one pebble on an adjacent vertex. The pebbling number is the smallest $t$ so that from any initial configuration of $t$ pebbles it is possible, after a sequence of pebbling moves, to place a pebble on any given target vertex. Graphs whose pebbling number is equal to the number of vertices are called Class~$0$ and provide a challenging set of graphs that resist being characterized. In this note, we answer a question recently proposed by the pioneering study on"},"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":"2505.22941","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-05-28T23:45:27Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"cd9bb1c2b5f7c3cfe8296976c31e8acb223fd18e7f282e807367c6596932c77e","abstract_canon_sha256":"68e16f8beeee787d2ad7b3e1576f0d52bc32e016d2dfd07947f6e202d363c1ec"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:14:29.622096Z","signature_b64":"JNldRX48f3blu3knLWudzp5cBk9iUvoW1KfeXYNFQ6COWrdWMsOu5mofKYMIvyWgdUBTAaV6hfhCmoVzeMO0Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"391069cea4382ac144118b632edbd6dfb235e23a4e0b10f62d7855aa11d69460","last_reissued_at":"2026-07-05T11:14:29.621656Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:14:29.621656Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The only Class 0 Flower snark is the smallest","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Andr\\'e Luis Alves Martins, Celina Miraglia Herrera de Figueiredo, Franklin de Lima Marquezino, Guilherme Adamatti Bridi","submitted_at":"2025-05-28T23:45:27Z","abstract_excerpt":"Graph pebbling is a game played on graphs with pebbles on their vertices. A pebbling move removes two pebbles from one vertex and places one pebble on an adjacent vertex. The pebbling number is the smallest $t$ so that from any initial configuration of $t$ pebbles it is possible, after a sequence of pebbling moves, to place a pebble on any given target vertex. Graphs whose pebbling number is equal to the number of vertices are called Class~$0$ and provide a challenging set of graphs that resist being characterized. In this note, we answer a question recently proposed by the pioneering study on"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.22941","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2505.22941/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2505.22941","created_at":"2026-07-05T11:14:29.621714+00:00"},{"alias_kind":"arxiv_version","alias_value":"2505.22941v2","created_at":"2026-07-05T11:14:29.621714+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.22941","created_at":"2026-07-05T11:14:29.621714+00:00"},{"alias_kind":"pith_short_12","alias_value":"HEIGTTVEHAVM","created_at":"2026-07-05T11:14:29.621714+00:00"},{"alias_kind":"pith_short_16","alias_value":"HEIGTTVEHAVMCRAR","created_at":"2026-07-05T11:14:29.621714+00:00"},{"alias_kind":"pith_short_8","alias_value":"HEIGTTVE","created_at":"2026-07-05T11:14:29.621714+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/HEIGTTVEHAVMCRARRNRS5W6W36","json":"https://pith.science/pith/HEIGTTVEHAVMCRARRNRS5W6W36.json","graph_json":"https://pith.science/api/pith-number/HEIGTTVEHAVMCRARRNRS5W6W36/graph.json","events_json":"https://pith.science/api/pith-number/HEIGTTVEHAVMCRARRNRS5W6W36/events.json","paper":"https://pith.science/paper/HEIGTTVE"},"agent_actions":{"view_html":"https://pith.science/pith/HEIGTTVEHAVMCRARRNRS5W6W36","download_json":"https://pith.science/pith/HEIGTTVEHAVMCRARRNRS5W6W36.json","view_paper":"https://pith.science/paper/HEIGTTVE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2505.22941&json=true","fetch_graph":"https://pith.science/api/pith-number/HEIGTTVEHAVMCRARRNRS5W6W36/graph.json","fetch_events":"https://pith.science/api/pith-number/HEIGTTVEHAVMCRARRNRS5W6W36/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HEIGTTVEHAVMCRARRNRS5W6W36/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HEIGTTVEHAVMCRARRNRS5W6W36/action/storage_attestation","attest_author":"https://pith.science/pith/HEIGTTVEHAVMCRARRNRS5W6W36/action/author_attestation","sign_citation":"https://pith.science/pith/HEIGTTVEHAVMCRARRNRS5W6W36/action/citation_signature","submit_replication":"https://pith.science/pith/HEIGTTVEHAVMCRARRNRS5W6W36/action/replication_record"}},"created_at":"2026-07-05T11:14:29.621714+00:00","updated_at":"2026-07-05T11:14:29.621714+00:00"}