{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:AN6CPAGSE7MPJASQMKQGBIMZHA","short_pith_number":"pith:AN6CPAGS","schema_version":"1.0","canonical_sha256":"037c2780d227d8f4825062a060a1993813b427d24dd8938c99295ca484813177","source":{"kind":"arxiv","id":"1009.5162","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1009.5162","created_at":"2026-05-18T04:40:19.086492+00:00"},{"alias_kind":"arxiv_version","alias_value":"1009.5162v1","created_at":"2026-05-18T04:40:19.086492+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1009.5162","created_at":"2026-05-18T04:40:19.086492+00:00"},{"alias_kind":"pith_short_12","alias_value":"AN6CPAGSE7MP","created_at":"2026-05-18T12:26:05.355336+00:00"},{"alias_kind":"pith_short_16","alias_value":"AN6CPAGSE7MPJASQ","created_at":"2026-05-18T12:26:05.355336+00:00"},{"alias_kind":"pith_short_8","alias_value":"AN6CPAGS","created_at":"2026-05-18T12:26:05.355336+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/AN6CPAGSE7MPJASQMKQGBIMZHA","json":"https://pith.science/pith/AN6CPAGSE7MPJASQMKQGBIMZHA.json","graph_json":"https://pith.science/api/pith-number/AN6CPAGSE7MPJASQMKQGBIMZHA/graph.json","events_json":"https://pith.science/api/pith-number/AN6CPAGSE7MPJASQMKQGBIMZHA/events.json","paper":"https://pith.science/paper/AN6CPAGS"},"agent_actions":{"view_html":"https://pith.science/pith/AN6CPAGSE7MPJASQMKQGBIMZHA","download_json":"https://pith.science/pith/AN6CPAGSE7MPJASQMKQGBIMZHA.json","view_paper":"https://pith.science/paper/AN6CPAGS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1009.5162&json=true","fetch_graph":"https://pith.science/api/pith-number/AN6CPAGSE7MPJASQMKQGBIMZHA/graph.json","fetch_events":"https://pith.science/api/pith-number/AN6CPAGSE7MPJASQMKQGBIMZHA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AN6CPAGSE7MPJASQMKQGBIMZHA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AN6CPAGSE7MPJASQMKQGBIMZHA/action/storage_attestation","attest_author":"https://pith.science/pith/AN6CPAGSE7MPJASQMKQGBIMZHA/action/author_attestation","sign_citation":"https://pith.science/pith/AN6CPAGSE7MPJASQMKQGBIMZHA/action/citation_signature","submit_replication":"https://pith.science/pith/AN6CPAGSE7MPJASQMKQGBIMZHA/action/replication_record"}},"created_at":"2026-05-18T04:40:19.086492+00:00","updated_at":"2026-05-18T04:40:19.086492+00:00"}