{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:U7YD3XSTJFNRIJOJ7XESOH7HKY","short_pith_number":"pith:U7YD3XST","canonical_record":{"source":{"id":"1804.03717","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-04-10T21:00:52Z","cross_cats_sorted":[],"title_canon_sha256":"cd3ce940920e8f3c3360923bf6bbd650f6ad439fbe568235ac8ca1a1794fbfbc","abstract_canon_sha256":"0e65bc3f73026746b9494eb8438362cd95b548bb56e94e738bdf805eefb72c6f"},"schema_version":"1.0"},"canonical_sha256":"a7f03dde53495b1425c9fdc9271fe7560ec2170e5c6c739bb840e34593fb42d0","source":{"kind":"arxiv","id":"1804.03717","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.03717","created_at":"2026-05-18T00:18:45Z"},{"alias_kind":"arxiv_version","alias_value":"1804.03717v1","created_at":"2026-05-18T00:18:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.03717","created_at":"2026-05-18T00:18:45Z"},{"alias_kind":"pith_short_12","alias_value":"U7YD3XSTJFNR","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_16","alias_value":"U7YD3XSTJFNRIJOJ","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_8","alias_value":"U7YD3XST","created_at":"2026-05-18T12:32:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:U7YD3XSTJFNRIJOJ7XESOH7HKY","target":"record","payload":{"canonical_record":{"source":{"id":"1804.03717","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-04-10T21:00:52Z","cross_cats_sorted":[],"title_canon_sha256":"cd3ce940920e8f3c3360923bf6bbd650f6ad439fbe568235ac8ca1a1794fbfbc","abstract_canon_sha256":"0e65bc3f73026746b9494eb8438362cd95b548bb56e94e738bdf805eefb72c6f"},"schema_version":"1.0"},"canonical_sha256":"a7f03dde53495b1425c9fdc9271fe7560ec2170e5c6c739bb840e34593fb42d0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:18:45.198301Z","signature_b64":"V3NO2FUGnjt+yUv2NMrcBWyGBrqJFt1jU2Rcn22GBQgAuBJVFx3G+SHT8VlX4egHj46h5lffZUG+lFmI21jwDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a7f03dde53495b1425c9fdc9271fe7560ec2170e5c6c739bb840e34593fb42d0","last_reissued_at":"2026-05-18T00:18:45.197733Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:18:45.197733Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1804.03717","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-18T00:18:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sKc9A+esCw5RJ3q9sh++q/D0cV8/Ey3Vo5gEGxXpA8EUpac/xNTk0QuvO0zd43ppYLtX0Y1++lYNagVKMt+oDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T09:05:11.920119Z"},"content_sha256":"76ff8ab5cbbf3c5fbf26d86677f49d485dc702c98707b316c5d2f2e47bcd927a","schema_version":"1.0","event_id":"sha256:76ff8ab5cbbf3c5fbf26d86677f49d485dc702c98707b316c5d2f2e47bcd927a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:U7YD3XSTJFNRIJOJ7XESOH7HKY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal pebbling number of graphs with given minimum degree","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Andrzej Czygrinow, Glenn Hurlbert, Gyula Y. Katona, L\\'aszl\\'o F. Papp","submitted_at":"2018-04-10T21:00:52Z","abstract_excerpt":"Consider a distribution of pebbles on a connected graph $G$. A pebbling move removes two pebbles from a vertex and places one to an adjacent vertex. A vertex is reachable under a pebbling distribution if it has a pebble after the application of a sequence of pebbling moves. The optimal pebbling number $\\pi^*(G)$ is the smallest number of pebbles which we can distribute in such a way that each vertex is reachable. It was known that the optimal pebbling number of any connected graph is at most $\\frac{4n}{\\delta+1}$, where $\\delta$ is the minimum degree of the graph. We strengthen this bound by s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.03717","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-18T00:18:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/Q8fXAVVfbKots7PYg4WLvLm+gTnNoc94Dh04gG6L9a168E/KHT5LDkI/c3QUGuD3/govMpBDoLGmbmsetGVBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T09:05:11.920511Z"},"content_sha256":"74f6496bb358405b564ad2c1e21fa7b5b74b857c2de0fc3909c1fd6af21e64ff","schema_version":"1.0","event_id":"sha256:74f6496bb358405b564ad2c1e21fa7b5b74b857c2de0fc3909c1fd6af21e64ff"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/U7YD3XSTJFNRIJOJ7XESOH7HKY/bundle.json","state_url":"https://pith.science/pith/U7YD3XSTJFNRIJOJ7XESOH7HKY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/U7YD3XSTJFNRIJOJ7XESOH7HKY/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-05-28T09:05:11Z","links":{"resolver":"https://pith.science/pith/U7YD3XSTJFNRIJOJ7XESOH7HKY","bundle":"https://pith.science/pith/U7YD3XSTJFNRIJOJ7XESOH7HKY/bundle.json","state":"https://pith.science/pith/U7YD3XSTJFNRIJOJ7XESOH7HKY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/U7YD3XSTJFNRIJOJ7XESOH7HKY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:U7YD3XSTJFNRIJOJ7XESOH7HKY","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":"0e65bc3f73026746b9494eb8438362cd95b548bb56e94e738bdf805eefb72c6f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-04-10T21:00:52Z","title_canon_sha256":"cd3ce940920e8f3c3360923bf6bbd650f6ad439fbe568235ac8ca1a1794fbfbc"},"schema_version":"1.0","source":{"id":"1804.03717","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.03717","created_at":"2026-05-18T00:18:45Z"},{"alias_kind":"arxiv_version","alias_value":"1804.03717v1","created_at":"2026-05-18T00:18:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.03717","created_at":"2026-05-18T00:18:45Z"},{"alias_kind":"pith_short_12","alias_value":"U7YD3XSTJFNR","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_16","alias_value":"U7YD3XSTJFNRIJOJ","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_8","alias_value":"U7YD3XST","created_at":"2026-05-18T12:32:56Z"}],"graph_snapshots":[{"event_id":"sha256:74f6496bb358405b564ad2c1e21fa7b5b74b857c2de0fc3909c1fd6af21e64ff","target":"graph","created_at":"2026-05-18T00:18:45Z","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":"Consider a distribution of pebbles on a connected graph $G$. A pebbling move removes two pebbles from a vertex and places one to an adjacent vertex. A vertex is reachable under a pebbling distribution if it has a pebble after the application of a sequence of pebbling moves. The optimal pebbling number $\\pi^*(G)$ is the smallest number of pebbles which we can distribute in such a way that each vertex is reachable. It was known that the optimal pebbling number of any connected graph is at most $\\frac{4n}{\\delta+1}$, where $\\delta$ is the minimum degree of the graph. We strengthen this bound by s","authors_text":"Andrzej Czygrinow, Glenn Hurlbert, Gyula Y. Katona, L\\'aszl\\'o F. Papp","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-04-10T21:00:52Z","title":"Optimal pebbling number of graphs with given minimum degree"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.03717","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:76ff8ab5cbbf3c5fbf26d86677f49d485dc702c98707b316c5d2f2e47bcd927a","target":"record","created_at":"2026-05-18T00:18:45Z","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":"0e65bc3f73026746b9494eb8438362cd95b548bb56e94e738bdf805eefb72c6f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-04-10T21:00:52Z","title_canon_sha256":"cd3ce940920e8f3c3360923bf6bbd650f6ad439fbe568235ac8ca1a1794fbfbc"},"schema_version":"1.0","source":{"id":"1804.03717","kind":"arxiv","version":1}},"canonical_sha256":"a7f03dde53495b1425c9fdc9271fe7560ec2170e5c6c739bb840e34593fb42d0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a7f03dde53495b1425c9fdc9271fe7560ec2170e5c6c739bb840e34593fb42d0","first_computed_at":"2026-05-18T00:18:45.197733Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:18:45.197733Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"V3NO2FUGnjt+yUv2NMrcBWyGBrqJFt1jU2Rcn22GBQgAuBJVFx3G+SHT8VlX4egHj46h5lffZUG+lFmI21jwDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:18:45.198301Z","signed_message":"canonical_sha256_bytes"},"source_id":"1804.03717","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:76ff8ab5cbbf3c5fbf26d86677f49d485dc702c98707b316c5d2f2e47bcd927a","sha256:74f6496bb358405b564ad2c1e21fa7b5b74b857c2de0fc3909c1fd6af21e64ff"],"state_sha256":"8b1922db120ecb98174e02801ab59ca03ae278e471ddf99cc7befde070c3633a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zGpokPqNAF6eWvcwpjc5FOBxULUN4a63+yjIDfhsPUMJoQPc9uR5Pu6S4QJ4xgcMstlyz8LpzEQggv89Yo5+CQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T09:05:11.922608Z","bundle_sha256":"308556501fd448aa1ddb43b32ee4f632b0442e97899870b1b67efbb7d3ac683a"}}