{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2005:2Z4BXX3Q33IHNA2K3EQMIIISJC","short_pith_number":"pith:2Z4BXX3Q","canonical_record":{"source":{"id":"math/0510621","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"math.CO","submitted_at":"2005-10-28T05:27:13Z","cross_cats_sorted":[],"title_canon_sha256":"ae094d77a9ad143d2de65314e544d0b22f65b18d0a1b677a4175c61b0fde2688","abstract_canon_sha256":"3f79af95e028c9e75e475e6fa4da496b9e224c5f14fe7a39f4e2a509157bbc06"},"schema_version":"1.0"},"canonical_sha256":"d6781bdf70ded076834ad920c421124883c51c083b4d28031921cdbfda87d22d","source":{"kind":"arxiv","id":"math/0510621","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"math/0510621","created_at":"2026-05-18T04:11:08Z"},{"alias_kind":"arxiv_version","alias_value":"math/0510621v1","created_at":"2026-05-18T04:11:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0510621","created_at":"2026-05-18T04:11:08Z"},{"alias_kind":"pith_short_12","alias_value":"2Z4BXX3Q33IH","created_at":"2026-05-18T12:25:52Z"},{"alias_kind":"pith_short_16","alias_value":"2Z4BXX3Q33IHNA2K","created_at":"2026-05-18T12:25:52Z"},{"alias_kind":"pith_short_8","alias_value":"2Z4BXX3Q","created_at":"2026-05-18T12:25:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2005:2Z4BXX3Q33IHNA2K3EQMIIISJC","target":"record","payload":{"canonical_record":{"source":{"id":"math/0510621","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"math.CO","submitted_at":"2005-10-28T05:27:13Z","cross_cats_sorted":[],"title_canon_sha256":"ae094d77a9ad143d2de65314e544d0b22f65b18d0a1b677a4175c61b0fde2688","abstract_canon_sha256":"3f79af95e028c9e75e475e6fa4da496b9e224c5f14fe7a39f4e2a509157bbc06"},"schema_version":"1.0"},"canonical_sha256":"d6781bdf70ded076834ad920c421124883c51c083b4d28031921cdbfda87d22d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:11:08.941750Z","signature_b64":"7Qi6SCDKEokKVN93ICjEhxva8Vxrw+3wveZ1jS0kNAh7rKxKtYmxR8SZoUMObMD871qdockkN+JkNwK+K8P9Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d6781bdf70ded076834ad920c421124883c51c083b4d28031921cdbfda87d22d","last_reissued_at":"2026-05-18T04:11:08.941186Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:11:08.941186Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"math/0510621","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-05-18T04:11:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CVBK9+SwqpgWr/lUtGmdw9Auo9kFOdKjfhRJYxhOJAXciqvdjaUlvsTjq/aB/a+uEz4HlWnLn8YvSaoVHz1AAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T02:26:43.981727Z"},"content_sha256":"8b40fc88071471053ab752d5c7b82fa153b7bb461045180450a60d3d1315e538","schema_version":"1.0","event_id":"sha256:8b40fc88071471053ab752d5c7b82fa153b7bb461045180450a60d3d1315e538"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2005:2Z4BXX3Q33IHNA2K3EQMIIISJC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Pebbling and Optimal Pebbling in Graphs","license":"","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"D. B. West, D. Cranston, D. P. Bunde, E. W. Chambers, K. Milans","submitted_at":"2005-10-28T05:27:13Z","abstract_excerpt":"Given a distribution of pebbles on the vertices of a graph G, a {\\it pebbling move} takes two pebbles from one vertex and puts one on a neighboring vertex. The {\\it pebbling number} \\Pi(G) is the minimum k such that for every distribution of k pebbles and every vertex r, it is possible to move a pebble to r. The {\\it optimal pebbling number} \\Pi_{OPT}(G) is the minimum k such that some distribution of k pebbles permits reaching each vertex.\n  We give short proofs of prior results on these parameters for paths, cycles, trees, and hypercubes, a new linear-time algorithm for computing \\Pi(G) on t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0510621","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"},"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-05-18T04:11:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5Z+hshRcSCMCWe/hUtnPt7A0ExR3b+X84IL4idAFf59prOcPOaejzZmcllutMI/xkeBD0V5Du0PaEk0REFUaBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T02:26:43.982272Z"},"content_sha256":"54a4b1c6c2468f37a196812d7a6bc6072ee0452b8bd6f11201462c2a1f74f39a","schema_version":"1.0","event_id":"sha256:54a4b1c6c2468f37a196812d7a6bc6072ee0452b8bd6f11201462c2a1f74f39a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2Z4BXX3Q33IHNA2K3EQMIIISJC/bundle.json","state_url":"https://pith.science/pith/2Z4BXX3Q33IHNA2K3EQMIIISJC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2Z4BXX3Q33IHNA2K3EQMIIISJC/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-06-11T02:26:43Z","links":{"resolver":"https://pith.science/pith/2Z4BXX3Q33IHNA2K3EQMIIISJC","bundle":"https://pith.science/pith/2Z4BXX3Q33IHNA2K3EQMIIISJC/bundle.json","state":"https://pith.science/pith/2Z4BXX3Q33IHNA2K3EQMIIISJC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2Z4BXX3Q33IHNA2K3EQMIIISJC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2005:2Z4BXX3Q33IHNA2K3EQMIIISJC","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":"3f79af95e028c9e75e475e6fa4da496b9e224c5f14fe7a39f4e2a509157bbc06","cross_cats_sorted":[],"license":"","primary_cat":"math.CO","submitted_at":"2005-10-28T05:27:13Z","title_canon_sha256":"ae094d77a9ad143d2de65314e544d0b22f65b18d0a1b677a4175c61b0fde2688"},"schema_version":"1.0","source":{"id":"math/0510621","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"math/0510621","created_at":"2026-05-18T04:11:08Z"},{"alias_kind":"arxiv_version","alias_value":"math/0510621v1","created_at":"2026-05-18T04:11:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0510621","created_at":"2026-05-18T04:11:08Z"},{"alias_kind":"pith_short_12","alias_value":"2Z4BXX3Q33IH","created_at":"2026-05-18T12:25:52Z"},{"alias_kind":"pith_short_16","alias_value":"2Z4BXX3Q33IHNA2K","created_at":"2026-05-18T12:25:52Z"},{"alias_kind":"pith_short_8","alias_value":"2Z4BXX3Q","created_at":"2026-05-18T12:25:52Z"}],"graph_snapshots":[{"event_id":"sha256:54a4b1c6c2468f37a196812d7a6bc6072ee0452b8bd6f11201462c2a1f74f39a","target":"graph","created_at":"2026-05-18T04:11:08Z","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"},"paper":{"abstract_excerpt":"Given a distribution of pebbles on the vertices of a graph G, a {\\it pebbling move} takes two pebbles from one vertex and puts one on a neighboring vertex. The {\\it pebbling number} \\Pi(G) is the minimum k such that for every distribution of k pebbles and every vertex r, it is possible to move a pebble to r. The {\\it optimal pebbling number} \\Pi_{OPT}(G) is the minimum k such that some distribution of k pebbles permits reaching each vertex.\n  We give short proofs of prior results on these parameters for paths, cycles, trees, and hypercubes, a new linear-time algorithm for computing \\Pi(G) on t","authors_text":"D. B. West, D. Cranston, D. P. Bunde, E. W. Chambers, K. Milans","cross_cats":[],"headline":"","license":"","primary_cat":"math.CO","submitted_at":"2005-10-28T05:27:13Z","title":"Pebbling and Optimal Pebbling in Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0510621","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:8b40fc88071471053ab752d5c7b82fa153b7bb461045180450a60d3d1315e538","target":"record","created_at":"2026-05-18T04:11:08Z","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":"3f79af95e028c9e75e475e6fa4da496b9e224c5f14fe7a39f4e2a509157bbc06","cross_cats_sorted":[],"license":"","primary_cat":"math.CO","submitted_at":"2005-10-28T05:27:13Z","title_canon_sha256":"ae094d77a9ad143d2de65314e544d0b22f65b18d0a1b677a4175c61b0fde2688"},"schema_version":"1.0","source":{"id":"math/0510621","kind":"arxiv","version":1}},"canonical_sha256":"d6781bdf70ded076834ad920c421124883c51c083b4d28031921cdbfda87d22d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d6781bdf70ded076834ad920c421124883c51c083b4d28031921cdbfda87d22d","first_computed_at":"2026-05-18T04:11:08.941186Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:11:08.941186Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7Qi6SCDKEokKVN93ICjEhxva8Vxrw+3wveZ1jS0kNAh7rKxKtYmxR8SZoUMObMD871qdockkN+JkNwK+K8P9Bw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:11:08.941750Z","signed_message":"canonical_sha256_bytes"},"source_id":"math/0510621","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8b40fc88071471053ab752d5c7b82fa153b7bb461045180450a60d3d1315e538","sha256:54a4b1c6c2468f37a196812d7a6bc6072ee0452b8bd6f11201462c2a1f74f39a"],"state_sha256":"fe51ed177ab95e349bfc79c520bbfbf83d34d3bc6b8f9b9afec1eb3eddbb4453"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"a3Gvt917F898mFvQPg1Ms6zfuU7SNIS+VYZhbGKRRwUOCvuZcU793KFnFLbyYSawvLoP28pUgOpBUpXbvggxAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T02:26:43.985297Z","bundle_sha256":"c068d3080b24ddb8e24a2e2d47be03acdbda9d8b085de7cdd536b09168dad000"}}