{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:CJ7USQEX2WBTSSNXMQG2FWKQEV","short_pith_number":"pith:CJ7USQEX","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"},"canonical_sha256":"127f494097d5833949b7640da2d9502566582d667ccf7900d14355c669de9de7","source":{"kind":"arxiv","id":"2312.12618","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2312.12618","created_at":"2026-07-05T07:26:23Z"},{"alias_kind":"arxiv_version","alias_value":"2312.12618v1","created_at":"2026-07-05T07:26:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2312.12618","created_at":"2026-07-05T07:26:23Z"},{"alias_kind":"pith_short_12","alias_value":"CJ7USQEX2WBT","created_at":"2026-07-05T07:26:23Z"},{"alias_kind":"pith_short_16","alias_value":"CJ7USQEX2WBTSSNX","created_at":"2026-07-05T07:26:23Z"},{"alias_kind":"pith_short_8","alias_value":"CJ7USQEX","created_at":"2026-07-05T07:26:23Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:CJ7USQEX2WBTSSNXMQG2FWKQEV","target":"record","payload":{"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"},"canonical_sha256":"127f494097d5833949b7640da2d9502566582d667ccf7900d14355c669de9de7","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"},"source_kind":"arxiv","source_id":"2312.12618","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-07-05T07:26:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"u4BkX7Y6desmpyDPydHRkH6iDgaMnbdXYC4dn/VAusaSYPlKjj6XRTBnZVl8VF+R8Pl0JKBWz3UMZdvN5JGgBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T20:36:56.684419Z"},"content_sha256":"6a9f801eb922085fe04c98ecd6472b9219a5d3e0202b3916f4da2cef74b040f0","schema_version":"1.0","event_id":"sha256:6a9f801eb922085fe04c98ecd6472b9219a5d3e0202b3916f4da2cef74b040f0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:CJ7USQEX2WBTSSNXMQG2FWKQEV","target":"graph","payload":{"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"},"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-07-05T07:26:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pw+Pc1khUW4ovBU5XDyXYXbsDlvlGJcqV2Z4o+bLc4mWSa3V9AOVZetcMixfRazPCBPr1fFHXlz0OOOog2/rDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T20:36:56.685315Z"},"content_sha256":"1cabe006a07ad1cfe6f60215e3a839e282f6696968afe16caf1b0eedd0b12585","schema_version":"1.0","event_id":"sha256:1cabe006a07ad1cfe6f60215e3a839e282f6696968afe16caf1b0eedd0b12585"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CJ7USQEX2WBTSSNXMQG2FWKQEV/bundle.json","state_url":"https://pith.science/pith/CJ7USQEX2WBTSSNXMQG2FWKQEV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CJ7USQEX2WBTSSNXMQG2FWKQEV/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-08-09T20:36:56Z","links":{"resolver":"https://pith.science/pith/CJ7USQEX2WBTSSNXMQG2FWKQEV","bundle":"https://pith.science/pith/CJ7USQEX2WBTSSNXMQG2FWKQEV/bundle.json","state":"https://pith.science/pith/CJ7USQEX2WBTSSNXMQG2FWKQEV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CJ7USQEX2WBTSSNXMQG2FWKQEV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:CJ7USQEX2WBTSSNXMQG2FWKQEV","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":"82bda08e0fcc0668634602ea2087f8c30f23b7f227722fbedf90f1bfc1bd2ebd","cross_cats_sorted":["cs.DM"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2023-12-19T21:52:45Z","title_canon_sha256":"e1ef132dbe77505c4cd77a13687dab120f1cacfae5f687da8cd5a321f62d4f65"},"schema_version":"1.0","source":{"id":"2312.12618","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2312.12618","created_at":"2026-07-05T07:26:23Z"},{"alias_kind":"arxiv_version","alias_value":"2312.12618v1","created_at":"2026-07-05T07:26:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2312.12618","created_at":"2026-07-05T07:26:23Z"},{"alias_kind":"pith_short_12","alias_value":"CJ7USQEX2WBT","created_at":"2026-07-05T07:26:23Z"},{"alias_kind":"pith_short_16","alias_value":"CJ7USQEX2WBTSSNX","created_at":"2026-07-05T07:26:23Z"},{"alias_kind":"pith_short_8","alias_value":"CJ7USQEX","created_at":"2026-07-05T07:26:23Z"}],"graph_snapshots":[{"event_id":"sha256:1cabe006a07ad1cfe6f60215e3a839e282f6696968afe16caf1b0eedd0b12585","target":"graph","created_at":"2026-07-05T07:26:23Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2312.12618/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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 ","authors_text":"Carl Yerger, Dominic Flocco, Jonad Pulaj","cross_cats":["cs.DM"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2023-12-19T21:52:45Z","title":"Automating Weight Function Generation in Graph Pebbling"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2312.12618","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:6a9f801eb922085fe04c98ecd6472b9219a5d3e0202b3916f4da2cef74b040f0","target":"record","created_at":"2026-07-05T07:26:23Z","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":"82bda08e0fcc0668634602ea2087f8c30f23b7f227722fbedf90f1bfc1bd2ebd","cross_cats_sorted":["cs.DM"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2023-12-19T21:52:45Z","title_canon_sha256":"e1ef132dbe77505c4cd77a13687dab120f1cacfae5f687da8cd5a321f62d4f65"},"schema_version":"1.0","source":{"id":"2312.12618","kind":"arxiv","version":1}},"canonical_sha256":"127f494097d5833949b7640da2d9502566582d667ccf7900d14355c669de9de7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"127f494097d5833949b7640da2d9502566582d667ccf7900d14355c669de9de7","first_computed_at":"2026-07-05T07:26:23.798242Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:26:23.798242Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"udQpf4CKtuupAMwxIdJW/jKKCExxC2viwO9/e4URPwfR5hyuzS5+MMcIgSZzC6h3ZrO7DQE+aKWzufQXSfyLAw==","signature_status":"signed_v1","signed_at":"2026-07-05T07:26:23.798719Z","signed_message":"canonical_sha256_bytes"},"source_id":"2312.12618","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6a9f801eb922085fe04c98ecd6472b9219a5d3e0202b3916f4da2cef74b040f0","sha256:1cabe006a07ad1cfe6f60215e3a839e282f6696968afe16caf1b0eedd0b12585"],"state_sha256":"778af22e13b37595563f2e86f7661a5c0fc1acebbb1394727cff0cca511f0526"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LtXviXjsIbt1f8xBcqmbrwv1EERnW24+jt2tnF10K5cREcy6x6SGGOWLvH7hDPs9lnjpGEBgnbXLM7PhdhXfBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-09T20:36:56.693977Z","bundle_sha256":"c072f2a812923aeffaac1ba8e13cb3dc495146bcb3c43cd988fed28c7d1f7740"}}