{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:4YNLQIHNZWKCXOTMC737QVENTO","short_pith_number":"pith:4YNLQIHN","schema_version":"1.0","canonical_sha256":"e61ab820edcd942bba6c17f7f8548d9bb02f8cdbd9a1f35c73625a2921fc8d79","source":{"kind":"arxiv","id":"1801.07808","version":1},"attestation_state":"computed","paper":{"title":"Pebbling on Graph Products and other Binary Graph Constructions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Franklin Kenter, Glenn Hurlbert, John Asplund","submitted_at":"2018-01-23T23:30:08Z","abstract_excerpt":"Pebbling on graphs is a two-player game which involves repeatedly moving a pebble from one vertex to another by removing another pebble from the first vertex. The pebbling number $\\pi(G)$ is the least number of pebbles required so that, regardless of the initial configuration of pebbles, a pebble can reach any vertex. Graham conjectured that the pebbling number for the cartesian product, $G \\hspace{1mm}\\square\\hspace{1mm} H$, is bounded above by $\\pi(G) \\pi(H)$. We show that $\\pi(G\\hspace{1mm}\\square\\hspace{1mm} H) \\le 2\\pi(G) \\pi(H)$ and, more sharply, that $\\pi(G \\hspace{1mm}\\square\\hspace{1"},"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":"1801.07808","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-01-23T23:30:08Z","cross_cats_sorted":[],"title_canon_sha256":"9251786ea474caad229bd470d7f883c371867aaa9a370cd295610c01c10f4c92","abstract_canon_sha256":"79c32f62a9617b69e51099fa9f60b7a8391db60d51cb24b5f9cd13a63214637a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:25:10.793962Z","signature_b64":"Qe+1LlusYZE0g2h2qKhtVzN73It6RQSLsQqKk9vLan+0exCrRAb4dbwVYOKT7euVV2sB0lMr/uHQXTa1sQL0Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e61ab820edcd942bba6c17f7f8548d9bb02f8cdbd9a1f35c73625a2921fc8d79","last_reissued_at":"2026-05-18T00:25:10.793420Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:25:10.793420Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Pebbling on Graph Products and other Binary Graph Constructions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Franklin Kenter, Glenn Hurlbert, John Asplund","submitted_at":"2018-01-23T23:30:08Z","abstract_excerpt":"Pebbling on graphs is a two-player game which involves repeatedly moving a pebble from one vertex to another by removing another pebble from the first vertex. The pebbling number $\\pi(G)$ is the least number of pebbles required so that, regardless of the initial configuration of pebbles, a pebble can reach any vertex. Graham conjectured that the pebbling number for the cartesian product, $G \\hspace{1mm}\\square\\hspace{1mm} H$, is bounded above by $\\pi(G) \\pi(H)$. We show that $\\pi(G\\hspace{1mm}\\square\\hspace{1mm} H) \\le 2\\pi(G) \\pi(H)$ and, more sharply, that $\\pi(G \\hspace{1mm}\\square\\hspace{1"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.07808","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":"1801.07808","created_at":"2026-05-18T00:25:10.793489+00:00"},{"alias_kind":"arxiv_version","alias_value":"1801.07808v1","created_at":"2026-05-18T00:25:10.793489+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.07808","created_at":"2026-05-18T00:25:10.793489+00:00"},{"alias_kind":"pith_short_12","alias_value":"4YNLQIHNZWKC","created_at":"2026-05-18T12:32:05.422762+00:00"},{"alias_kind":"pith_short_16","alias_value":"4YNLQIHNZWKCXOTM","created_at":"2026-05-18T12:32:05.422762+00:00"},{"alias_kind":"pith_short_8","alias_value":"4YNLQIHN","created_at":"2026-05-18T12:32:05.422762+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/4YNLQIHNZWKCXOTMC737QVENTO","json":"https://pith.science/pith/4YNLQIHNZWKCXOTMC737QVENTO.json","graph_json":"https://pith.science/api/pith-number/4YNLQIHNZWKCXOTMC737QVENTO/graph.json","events_json":"https://pith.science/api/pith-number/4YNLQIHNZWKCXOTMC737QVENTO/events.json","paper":"https://pith.science/paper/4YNLQIHN"},"agent_actions":{"view_html":"https://pith.science/pith/4YNLQIHNZWKCXOTMC737QVENTO","download_json":"https://pith.science/pith/4YNLQIHNZWKCXOTMC737QVENTO.json","view_paper":"https://pith.science/paper/4YNLQIHN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1801.07808&json=true","fetch_graph":"https://pith.science/api/pith-number/4YNLQIHNZWKCXOTMC737QVENTO/graph.json","fetch_events":"https://pith.science/api/pith-number/4YNLQIHNZWKCXOTMC737QVENTO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4YNLQIHNZWKCXOTMC737QVENTO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4YNLQIHNZWKCXOTMC737QVENTO/action/storage_attestation","attest_author":"https://pith.science/pith/4YNLQIHNZWKCXOTMC737QVENTO/action/author_attestation","sign_citation":"https://pith.science/pith/4YNLQIHNZWKCXOTMC737QVENTO/action/citation_signature","submit_replication":"https://pith.science/pith/4YNLQIHNZWKCXOTMC737QVENTO/action/replication_record"}},"created_at":"2026-05-18T00:25:10.793489+00:00","updated_at":"2026-05-18T00:25:10.793489+00:00"}