{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:YMQ4P35EPL5HCK6HB4GK56MZ6D","short_pith_number":"pith:YMQ4P35E","schema_version":"1.0","canonical_sha256":"c321c7efa47afa712bc70f0caef999f0ebda97f74944dc4a0dbec6cd643e60e5","source":{"kind":"arxiv","id":"1501.04236","version":1},"attestation_state":"computed","paper":{"title":"Critical Pebbling Numbers of Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Courtney R. Gibbons, Erick J. Paul, Joshua D. Laison","submitted_at":"2015-01-17T22:14:10Z","abstract_excerpt":"We define three new pebbling parameters of a connected graph $G$, the $r$-, $g$-, and $u$-critical pebbling numbers. Together with the pebbling number, the optimal pebbling number, the number of vertices $n$ and the diameter $d$ of the graph, this yields 7 graph parameters. We determine the relationships between these parameters. We investigate properties of the $r$-critical pebbling number, and distinguish between greedy graphs, thrifty graphs, and graphs for which the $r$-critical pebbling number is $2^d$."},"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":"1501.04236","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-01-17T22:14:10Z","cross_cats_sorted":[],"title_canon_sha256":"cf1d7a1d8dc3b3edbb426718b2bd65797b524664444dd6bcd06f6bef9b96fed8","abstract_canon_sha256":"cac99449fbf0b6df300138964c0b2442e10e80f6eb5ae8afcbba5552c9dd3272"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:45:59.014855Z","signature_b64":"p7wUU3xQPjqWPiCCGuCUB/LMGKGeTobCC3OW0AQIa8FDU0vLvJhPVR9XvclOoxiIwT0zP7LE13qeF919kH+4DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c321c7efa47afa712bc70f0caef999f0ebda97f74944dc4a0dbec6cd643e60e5","last_reissued_at":"2026-05-18T00:45:59.014374Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:45:59.014374Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Critical Pebbling Numbers of Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Courtney R. Gibbons, Erick J. Paul, Joshua D. Laison","submitted_at":"2015-01-17T22:14:10Z","abstract_excerpt":"We define three new pebbling parameters of a connected graph $G$, the $r$-, $g$-, and $u$-critical pebbling numbers. Together with the pebbling number, the optimal pebbling number, the number of vertices $n$ and the diameter $d$ of the graph, this yields 7 graph parameters. We determine the relationships between these parameters. We investigate properties of the $r$-critical pebbling number, and distinguish between greedy graphs, thrifty graphs, and graphs for which the $r$-critical pebbling number is $2^d$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.04236","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":"1501.04236","created_at":"2026-05-18T00:45:59.014445+00:00"},{"alias_kind":"arxiv_version","alias_value":"1501.04236v1","created_at":"2026-05-18T00:45:59.014445+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.04236","created_at":"2026-05-18T00:45:59.014445+00:00"},{"alias_kind":"pith_short_12","alias_value":"YMQ4P35EPL5H","created_at":"2026-05-18T12:29:50.041715+00:00"},{"alias_kind":"pith_short_16","alias_value":"YMQ4P35EPL5HCK6H","created_at":"2026-05-18T12:29:50.041715+00:00"},{"alias_kind":"pith_short_8","alias_value":"YMQ4P35E","created_at":"2026-05-18T12:29:50.041715+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/YMQ4P35EPL5HCK6HB4GK56MZ6D","json":"https://pith.science/pith/YMQ4P35EPL5HCK6HB4GK56MZ6D.json","graph_json":"https://pith.science/api/pith-number/YMQ4P35EPL5HCK6HB4GK56MZ6D/graph.json","events_json":"https://pith.science/api/pith-number/YMQ4P35EPL5HCK6HB4GK56MZ6D/events.json","paper":"https://pith.science/paper/YMQ4P35E"},"agent_actions":{"view_html":"https://pith.science/pith/YMQ4P35EPL5HCK6HB4GK56MZ6D","download_json":"https://pith.science/pith/YMQ4P35EPL5HCK6HB4GK56MZ6D.json","view_paper":"https://pith.science/paper/YMQ4P35E","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1501.04236&json=true","fetch_graph":"https://pith.science/api/pith-number/YMQ4P35EPL5HCK6HB4GK56MZ6D/graph.json","fetch_events":"https://pith.science/api/pith-number/YMQ4P35EPL5HCK6HB4GK56MZ6D/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YMQ4P35EPL5HCK6HB4GK56MZ6D/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YMQ4P35EPL5HCK6HB4GK56MZ6D/action/storage_attestation","attest_author":"https://pith.science/pith/YMQ4P35EPL5HCK6HB4GK56MZ6D/action/author_attestation","sign_citation":"https://pith.science/pith/YMQ4P35EPL5HCK6HB4GK56MZ6D/action/citation_signature","submit_replication":"https://pith.science/pith/YMQ4P35EPL5HCK6HB4GK56MZ6D/action/replication_record"}},"created_at":"2026-05-18T00:45:59.014445+00:00","updated_at":"2026-05-18T00:45:59.014445+00:00"}