{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:CJ7USQEX2WBTSSNXMQG2FWKQEV","short_pith_number":"pith:CJ7USQEX","schema_version":"1.0","canonical_sha256":"127f494097d5833949b7640da2d9502566582d667ccf7900d14355c669de9de7","source":{"kind":"arxiv","id":"2312.12618","version":1},"attestation_state":"computed","paper":{"title":"Automating Weight Function Generation in Graph Pebbling","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Carl Yerger, Dominic Flocco, Jonad Pulaj","submitted_at":"2023-12-19T21:52:45Z","abstract_excerpt":"Graph pebbling is a combinatorial game played on an undirected graph with an initial configuration of pebbles. A pebbling move consists of removing two pebbles from one vertex and placing one pebble on an adjacent vertex. The pebbling number of a graph is the smallest number of pebbles necessary such that, given any initial configuration of pebbles, at least one pebble can be moved to a specified root vertex. Recent lines of inquiry apply computational techniques to pebbling bound generation and improvement.\n  Along these lines, we present a computational framework that produces a set of tree "},"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":"2312.12618","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2023-12-19T21:52:45Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"e1ef132dbe77505c4cd77a13687dab120f1cacfae5f687da8cd5a321f62d4f65","abstract_canon_sha256":"82bda08e0fcc0668634602ea2087f8c30f23b7f227722fbedf90f1bfc1bd2ebd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:26:23.798719Z","signature_b64":"udQpf4CKtuupAMwxIdJW/jKKCExxC2viwO9/e4URPwfR5hyuzS5+MMcIgSZzC6h3ZrO7DQE+aKWzufQXSfyLAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"127f494097d5833949b7640da2d9502566582d667ccf7900d14355c669de9de7","last_reissued_at":"2026-07-05T07:26:23.798242Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:26:23.798242Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Automating Weight Function Generation in Graph Pebbling","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Carl Yerger, Dominic Flocco, Jonad Pulaj","submitted_at":"2023-12-19T21:52:45Z","abstract_excerpt":"Graph pebbling is a combinatorial game played on an undirected graph with an initial configuration of pebbles. A pebbling move consists of removing two pebbles from one vertex and placing one pebble on an adjacent vertex. The pebbling number of a graph is the smallest number of pebbles necessary such that, given any initial configuration of pebbles, at least one pebble can be moved to a specified root vertex. Recent lines of inquiry apply computational techniques to pebbling bound generation and improvement.\n  Along these lines, we present a computational framework that produces a set of tree "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2312.12618","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2312.12618/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":"2312.12618","created_at":"2026-07-05T07:26:23.798303+00:00"},{"alias_kind":"arxiv_version","alias_value":"2312.12618v1","created_at":"2026-07-05T07:26:23.798303+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2312.12618","created_at":"2026-07-05T07:26:23.798303+00:00"},{"alias_kind":"pith_short_12","alias_value":"CJ7USQEX2WBT","created_at":"2026-07-05T07:26:23.798303+00:00"},{"alias_kind":"pith_short_16","alias_value":"CJ7USQEX2WBTSSNX","created_at":"2026-07-05T07:26:23.798303+00:00"},{"alias_kind":"pith_short_8","alias_value":"CJ7USQEX","created_at":"2026-07-05T07:26:23.798303+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/CJ7USQEX2WBTSSNXMQG2FWKQEV","json":"https://pith.science/pith/CJ7USQEX2WBTSSNXMQG2FWKQEV.json","graph_json":"https://pith.science/api/pith-number/CJ7USQEX2WBTSSNXMQG2FWKQEV/graph.json","events_json":"https://pith.science/api/pith-number/CJ7USQEX2WBTSSNXMQG2FWKQEV/events.json","paper":"https://pith.science/paper/CJ7USQEX"},"agent_actions":{"view_html":"https://pith.science/pith/CJ7USQEX2WBTSSNXMQG2FWKQEV","download_json":"https://pith.science/pith/CJ7USQEX2WBTSSNXMQG2FWKQEV.json","view_paper":"https://pith.science/paper/CJ7USQEX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2312.12618&json=true","fetch_graph":"https://pith.science/api/pith-number/CJ7USQEX2WBTSSNXMQG2FWKQEV/graph.json","fetch_events":"https://pith.science/api/pith-number/CJ7USQEX2WBTSSNXMQG2FWKQEV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CJ7USQEX2WBTSSNXMQG2FWKQEV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CJ7USQEX2WBTSSNXMQG2FWKQEV/action/storage_attestation","attest_author":"https://pith.science/pith/CJ7USQEX2WBTSSNXMQG2FWKQEV/action/author_attestation","sign_citation":"https://pith.science/pith/CJ7USQEX2WBTSSNXMQG2FWKQEV/action/citation_signature","submit_replication":"https://pith.science/pith/CJ7USQEX2WBTSSNXMQG2FWKQEV/action/replication_record"}},"created_at":"2026-07-05T07:26:23.798303+00:00","updated_at":"2026-07-05T07:26:23.798303+00:00"}