{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:AN6CPAGSE7MPJASQMKQGBIMZHA","short_pith_number":"pith:AN6CPAGS","canonical_record":{"source":{"id":"1009.5162","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-09-27T05:36:01Z","cross_cats_sorted":[],"title_canon_sha256":"51fe835416eb13636af47756ae255282f4bcda328e2505d224fc6af83bb923d1","abstract_canon_sha256":"43c3a868f86c7d35925d4d8739e09a5165854b3a144a124b3017e82232fd24ed"},"schema_version":"1.0"},"canonical_sha256":"037c2780d227d8f4825062a060a1993813b427d24dd8938c99295ca484813177","source":{"kind":"arxiv","id":"1009.5162","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1009.5162","created_at":"2026-05-18T04:40:19Z"},{"alias_kind":"arxiv_version","alias_value":"1009.5162v1","created_at":"2026-05-18T04:40:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1009.5162","created_at":"2026-05-18T04:40:19Z"},{"alias_kind":"pith_short_12","alias_value":"AN6CPAGSE7MP","created_at":"2026-05-18T12:26:05Z"},{"alias_kind":"pith_short_16","alias_value":"AN6CPAGSE7MPJASQ","created_at":"2026-05-18T12:26:05Z"},{"alias_kind":"pith_short_8","alias_value":"AN6CPAGS","created_at":"2026-05-18T12:26:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:AN6CPAGSE7MPJASQMKQGBIMZHA","target":"record","payload":{"canonical_record":{"source":{"id":"1009.5162","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-09-27T05:36:01Z","cross_cats_sorted":[],"title_canon_sha256":"51fe835416eb13636af47756ae255282f4bcda328e2505d224fc6af83bb923d1","abstract_canon_sha256":"43c3a868f86c7d35925d4d8739e09a5165854b3a144a124b3017e82232fd24ed"},"schema_version":"1.0"},"canonical_sha256":"037c2780d227d8f4825062a060a1993813b427d24dd8938c99295ca484813177","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:40:19.086910Z","signature_b64":"4z9XyGHbr77QZKzrRVBE3F4LDR6etPtjWwbiG1Xr7/+9CB/kdxn8ai8Z/NqfIavsN3N9oDYJea1adDGGzn6oAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"037c2780d227d8f4825062a060a1993813b427d24dd8938c99295ca484813177","last_reissued_at":"2026-05-18T04:40:19.086423Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:40:19.086423Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1009.5162","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:40:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nL0ZanmGRDok33xyFidRP0RriyaJ/tzqb2weLY27aWLXGdNQWmzhjcT1zUZiZYd09cZziDIeelGiBUHo3X+CDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T11:20:27.589475Z"},"content_sha256":"074fba8f1e7c5a338acde951d2defc2419418e3cc9b8510d758e880d8f119d9d","schema_version":"1.0","event_id":"sha256:074fba8f1e7c5a338acde951d2defc2419418e3cc9b8510d758e880d8f119d9d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:AN6CPAGSE7MPJASQMKQGBIMZHA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Bounds on the Rubbling and Optimal Rubbling Numbers of Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Gyula Y. Katona, Nandor Sieben","submitted_at":"2010-09-27T05:36:01Z","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 rubbling number is the smallest number $m$ needed to guarantee that any vertex is reachable from any pebble distribution of $m$ pebbles. The optimal rubbling numbe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1009.5162","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:40:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PjKfjuPvS1eo1D9AcwcclEbQN1e+qRMeOrNgRtVHPG6bCfUFrzvqMvphsdElGjaYz9wC9WFCrsVZuD/Yp/XbBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T11:20:27.589818Z"},"content_sha256":"6c74aae89606e6f3f40f384755f7c3ff0d0514d7f7ba810e9465fec2165cdbe9","schema_version":"1.0","event_id":"sha256:6c74aae89606e6f3f40f384755f7c3ff0d0514d7f7ba810e9465fec2165cdbe9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AN6CPAGSE7MPJASQMKQGBIMZHA/bundle.json","state_url":"https://pith.science/pith/AN6CPAGSE7MPJASQMKQGBIMZHA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AN6CPAGSE7MPJASQMKQGBIMZHA/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-08T11:20:27Z","links":{"resolver":"https://pith.science/pith/AN6CPAGSE7MPJASQMKQGBIMZHA","bundle":"https://pith.science/pith/AN6CPAGSE7MPJASQMKQGBIMZHA/bundle.json","state":"https://pith.science/pith/AN6CPAGSE7MPJASQMKQGBIMZHA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AN6CPAGSE7MPJASQMKQGBIMZHA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:AN6CPAGSE7MPJASQMKQGBIMZHA","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":"43c3a868f86c7d35925d4d8739e09a5165854b3a144a124b3017e82232fd24ed","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-09-27T05:36:01Z","title_canon_sha256":"51fe835416eb13636af47756ae255282f4bcda328e2505d224fc6af83bb923d1"},"schema_version":"1.0","source":{"id":"1009.5162","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1009.5162","created_at":"2026-05-18T04:40:19Z"},{"alias_kind":"arxiv_version","alias_value":"1009.5162v1","created_at":"2026-05-18T04:40:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1009.5162","created_at":"2026-05-18T04:40:19Z"},{"alias_kind":"pith_short_12","alias_value":"AN6CPAGSE7MP","created_at":"2026-05-18T12:26:05Z"},{"alias_kind":"pith_short_16","alias_value":"AN6CPAGSE7MPJASQ","created_at":"2026-05-18T12:26:05Z"},{"alias_kind":"pith_short_8","alias_value":"AN6CPAGS","created_at":"2026-05-18T12:26:05Z"}],"graph_snapshots":[{"event_id":"sha256:6c74aae89606e6f3f40f384755f7c3ff0d0514d7f7ba810e9465fec2165cdbe9","target":"graph","created_at":"2026-05-18T04:40:19Z","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 rubbling number is the smallest number $m$ needed to guarantee that any vertex is reachable from any pebble distribution of $m$ pebbles. The optimal rubbling numbe","authors_text":"Gyula Y. Katona, Nandor Sieben","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-09-27T05:36:01Z","title":"Bounds on the Rubbling and Optimal Rubbling Numbers of Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1009.5162","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:074fba8f1e7c5a338acde951d2defc2419418e3cc9b8510d758e880d8f119d9d","target":"record","created_at":"2026-05-18T04:40:19Z","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":"43c3a868f86c7d35925d4d8739e09a5165854b3a144a124b3017e82232fd24ed","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-09-27T05:36:01Z","title_canon_sha256":"51fe835416eb13636af47756ae255282f4bcda328e2505d224fc6af83bb923d1"},"schema_version":"1.0","source":{"id":"1009.5162","kind":"arxiv","version":1}},"canonical_sha256":"037c2780d227d8f4825062a060a1993813b427d24dd8938c99295ca484813177","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"037c2780d227d8f4825062a060a1993813b427d24dd8938c99295ca484813177","first_computed_at":"2026-05-18T04:40:19.086423Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:40:19.086423Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4z9XyGHbr77QZKzrRVBE3F4LDR6etPtjWwbiG1Xr7/+9CB/kdxn8ai8Z/NqfIavsN3N9oDYJea1adDGGzn6oAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:40:19.086910Z","signed_message":"canonical_sha256_bytes"},"source_id":"1009.5162","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:074fba8f1e7c5a338acde951d2defc2419418e3cc9b8510d758e880d8f119d9d","sha256:6c74aae89606e6f3f40f384755f7c3ff0d0514d7f7ba810e9465fec2165cdbe9"],"state_sha256":"43fa4f26c9822d2d793db4032ac2453594efe705b9783d85862f634bb2742ff0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PtCfV3qKo3oWItluqgiZgfBh8QLpf0nkbWeAdNWeUq56CLC6saqamjt5Z1xxH1LbWK34wqkTxyQ6eh/InyrXCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T11:20:27.591730Z","bundle_sha256":"2bf83dbaa6f0532341b37a9be358d1bbe99a229d5c4bb1c54276941bc38d2fd3"}}