{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:QI6SLHQZHSLFU5Z6NSR6UFAVZC","short_pith_number":"pith:QI6SLHQZ","canonical_record":{"source":{"id":"1411.0923","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-11-04T14:33:31Z","cross_cats_sorted":[],"title_canon_sha256":"a1da96e6b85aa05d6b42c634465af2048cf69c54be1125c8cb6f166565e1863b","abstract_canon_sha256":"12ab5d21001167a2d0c14da1d9ba0dd28d3a2e24f7616fe6e385cfd5bff9630f"},"schema_version":"1.0"},"canonical_sha256":"823d259e193c965a773e6ca3ea1415c8af1885288aede3b5c04249a537174e2d","source":{"kind":"arxiv","id":"1411.0923","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.0923","created_at":"2026-05-18T00:36:41Z"},{"alias_kind":"arxiv_version","alias_value":"1411.0923v2","created_at":"2026-05-18T00:36:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.0923","created_at":"2026-05-18T00:36:41Z"},{"alias_kind":"pith_short_12","alias_value":"QI6SLHQZHSLF","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_16","alias_value":"QI6SLHQZHSLFU5Z6","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_8","alias_value":"QI6SLHQZ","created_at":"2026-05-18T12:28:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:QI6SLHQZHSLFU5Z6NSR6UFAVZC","target":"record","payload":{"canonical_record":{"source":{"id":"1411.0923","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-11-04T14:33:31Z","cross_cats_sorted":[],"title_canon_sha256":"a1da96e6b85aa05d6b42c634465af2048cf69c54be1125c8cb6f166565e1863b","abstract_canon_sha256":"12ab5d21001167a2d0c14da1d9ba0dd28d3a2e24f7616fe6e385cfd5bff9630f"},"schema_version":"1.0"},"canonical_sha256":"823d259e193c965a773e6ca3ea1415c8af1885288aede3b5c04249a537174e2d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:36:41.739881Z","signature_b64":"9nHkj2CXMZlPTL1UDwzQkBb1Kzom/RbQHfZf1Qa83ibrlobWigUJR+soVHzs/eethgzDqGlTmu8fwYRs8M8jBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"823d259e193c965a773e6ca3ea1415c8af1885288aede3b5c04249a537174e2d","last_reissued_at":"2026-05-18T00:36:41.739417Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:36:41.739417Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1411.0923","source_version":2,"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:36:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"i/+dnxc9tw4ofNqdPFjJQBpLDAHZ08WNwInGHLkXMSLGpCvhJMExtv1NcINHCBpUzpIs43/mQ5OZRtw27U+HDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T15:11:01.080000Z"},"content_sha256":"46cbf600d6f2b35114e8ee8cb742504d97ef4a527191871c795dd7101f46eacd","schema_version":"1.0","event_id":"sha256:46cbf600d6f2b35114e8ee8cb742504d97ef4a527191871c795dd7101f46eacd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:QI6SLHQZHSLFU5Z6NSR6UFAVZC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Optimal Rubbling Number of Ladders, Prisms and M\\\"obius-ladders","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Gyula Y. Katona, L\\'aszl\\'o F. Papp","submitted_at":"2014-11-04T14:33:31Z","abstract_excerpt":"A pebbling move on a graph removes two pebbles at a vertex and adds one pebble at an adjacent vertex. Rubbling is a version of pebbling where an additional move is allowed. In this new move, one pebble each is removed at vertices $v$ and $w$ adjacent to a vertex $u$, and an extra pebble is added at vertex $u$. A vertex is reachable from a pebble distribution if it is possible to move a pebble to that vertex using rubbling moves. The optimal rubbling number is the smallest number $m$ needed to guarantee a pebble distribution of $m$ pebbles from which any vertex is reachable. We determine the op"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.0923","kind":"arxiv","version":2},"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:36:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QLNQdE5BY7bW3TwgcBI4NDy6glP6vW+JvaV2XQim91zA89Dn1/nljFwWIEmgDS/q4wGtGmG627FzYbfUbmg4AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T15:11:01.080399Z"},"content_sha256":"9c614837012d5197a50736d3fc3b9173020c34eece608dd8d0d632e1d01d9772","schema_version":"1.0","event_id":"sha256:9c614837012d5197a50736d3fc3b9173020c34eece608dd8d0d632e1d01d9772"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QI6SLHQZHSLFU5Z6NSR6UFAVZC/bundle.json","state_url":"https://pith.science/pith/QI6SLHQZHSLFU5Z6NSR6UFAVZC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QI6SLHQZHSLFU5Z6NSR6UFAVZC/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-28T15:11:01Z","links":{"resolver":"https://pith.science/pith/QI6SLHQZHSLFU5Z6NSR6UFAVZC","bundle":"https://pith.science/pith/QI6SLHQZHSLFU5Z6NSR6UFAVZC/bundle.json","state":"https://pith.science/pith/QI6SLHQZHSLFU5Z6NSR6UFAVZC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QI6SLHQZHSLFU5Z6NSR6UFAVZC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:QI6SLHQZHSLFU5Z6NSR6UFAVZC","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":"12ab5d21001167a2d0c14da1d9ba0dd28d3a2e24f7616fe6e385cfd5bff9630f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-11-04T14:33:31Z","title_canon_sha256":"a1da96e6b85aa05d6b42c634465af2048cf69c54be1125c8cb6f166565e1863b"},"schema_version":"1.0","source":{"id":"1411.0923","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.0923","created_at":"2026-05-18T00:36:41Z"},{"alias_kind":"arxiv_version","alias_value":"1411.0923v2","created_at":"2026-05-18T00:36:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.0923","created_at":"2026-05-18T00:36:41Z"},{"alias_kind":"pith_short_12","alias_value":"QI6SLHQZHSLF","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_16","alias_value":"QI6SLHQZHSLFU5Z6","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_8","alias_value":"QI6SLHQZ","created_at":"2026-05-18T12:28:46Z"}],"graph_snapshots":[{"event_id":"sha256:9c614837012d5197a50736d3fc3b9173020c34eece608dd8d0d632e1d01d9772","target":"graph","created_at":"2026-05-18T00:36:41Z","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":"A pebbling move on a graph removes two pebbles at a vertex and adds one pebble at an adjacent vertex. Rubbling is a version of pebbling where an additional move is allowed. In this new move, one pebble each is removed at vertices $v$ and $w$ adjacent to a vertex $u$, and an extra pebble is added at vertex $u$. A vertex is reachable from a pebble distribution if it is possible to move a pebble to that vertex using rubbling moves. The optimal rubbling number is the smallest number $m$ needed to guarantee a pebble distribution of $m$ pebbles from which any vertex is reachable. We determine the op","authors_text":"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":"2014-11-04T14:33:31Z","title":"The Optimal Rubbling Number of Ladders, Prisms and M\\\"obius-ladders"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.0923","kind":"arxiv","version":2},"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:46cbf600d6f2b35114e8ee8cb742504d97ef4a527191871c795dd7101f46eacd","target":"record","created_at":"2026-05-18T00:36:41Z","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":"12ab5d21001167a2d0c14da1d9ba0dd28d3a2e24f7616fe6e385cfd5bff9630f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-11-04T14:33:31Z","title_canon_sha256":"a1da96e6b85aa05d6b42c634465af2048cf69c54be1125c8cb6f166565e1863b"},"schema_version":"1.0","source":{"id":"1411.0923","kind":"arxiv","version":2}},"canonical_sha256":"823d259e193c965a773e6ca3ea1415c8af1885288aede3b5c04249a537174e2d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"823d259e193c965a773e6ca3ea1415c8af1885288aede3b5c04249a537174e2d","first_computed_at":"2026-05-18T00:36:41.739417Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:36:41.739417Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9nHkj2CXMZlPTL1UDwzQkBb1Kzom/RbQHfZf1Qa83ibrlobWigUJR+soVHzs/eethgzDqGlTmu8fwYRs8M8jBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:36:41.739881Z","signed_message":"canonical_sha256_bytes"},"source_id":"1411.0923","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:46cbf600d6f2b35114e8ee8cb742504d97ef4a527191871c795dd7101f46eacd","sha256:9c614837012d5197a50736d3fc3b9173020c34eece608dd8d0d632e1d01d9772"],"state_sha256":"25e740eaef292ccf4c55703a730d3ac7ab21a3f19e8a78f6554ceb0855dc74a5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mWgjpF0aXJ+yZ/pcNXKx/jmJcb6SgrWUPdEFxHJRuf8yLISIrLS6nlQjqsnpIFR/F10t6V4aiuObinX/GL9qCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T15:11:01.082935Z","bundle_sha256":"26cb57f0111e967f5aab068519ee142c8538ea8a7879eb08a5079a2eea0105eb"}}