{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:4YNLQIHNZWKCXOTMC737QVENTO","short_pith_number":"pith:4YNLQIHN","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"},"canonical_sha256":"e61ab820edcd942bba6c17f7f8548d9bb02f8cdbd9a1f35c73625a2921fc8d79","source":{"kind":"arxiv","id":"1801.07808","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.07808","created_at":"2026-05-18T00:25:10Z"},{"alias_kind":"arxiv_version","alias_value":"1801.07808v1","created_at":"2026-05-18T00:25:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.07808","created_at":"2026-05-18T00:25:10Z"},{"alias_kind":"pith_short_12","alias_value":"4YNLQIHNZWKC","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_16","alias_value":"4YNLQIHNZWKCXOTM","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_8","alias_value":"4YNLQIHN","created_at":"2026-05-18T12:32:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:4YNLQIHNZWKCXOTMC737QVENTO","target":"record","payload":{"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"},"canonical_sha256":"e61ab820edcd942bba6c17f7f8548d9bb02f8cdbd9a1f35c73625a2921fc8d79","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"},"source_kind":"arxiv","source_id":"1801.07808","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:25:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bMv7hS2XI1TWIayoC/utLJavGdIFXRIBaAwaRfj1zT1685jwY3+msZEXSUefRdoMV+OoN4eBHFojD3NFRRhpDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T07:42:20.257099Z"},"content_sha256":"c137421a34750f4916b3424eba5cc5dd78139b4829881202252ce65c2e6e5090","schema_version":"1.0","event_id":"sha256:c137421a34750f4916b3424eba5cc5dd78139b4829881202252ce65c2e6e5090"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:4YNLQIHNZWKCXOTMC737QVENTO","target":"graph","payload":{"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"},"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:25:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"piMEbIfYsA24lhZcSzibc93/F0PzWSv/eJGm+fBUBReGgwkwtCCJ89Jls+p55060wdbVeFl4Nsi77scosLiUDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T07:42:20.257800Z"},"content_sha256":"7e654df9d1ad115263bf47b4f3993d685d815034d5a7a6eed3af571e05c7f029","schema_version":"1.0","event_id":"sha256:7e654df9d1ad115263bf47b4f3993d685d815034d5a7a6eed3af571e05c7f029"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4YNLQIHNZWKCXOTMC737QVENTO/bundle.json","state_url":"https://pith.science/pith/4YNLQIHNZWKCXOTMC737QVENTO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4YNLQIHNZWKCXOTMC737QVENTO/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-31T07:42:20Z","links":{"resolver":"https://pith.science/pith/4YNLQIHNZWKCXOTMC737QVENTO","bundle":"https://pith.science/pith/4YNLQIHNZWKCXOTMC737QVENTO/bundle.json","state":"https://pith.science/pith/4YNLQIHNZWKCXOTMC737QVENTO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4YNLQIHNZWKCXOTMC737QVENTO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:4YNLQIHNZWKCXOTMC737QVENTO","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":"79c32f62a9617b69e51099fa9f60b7a8391db60d51cb24b5f9cd13a63214637a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-01-23T23:30:08Z","title_canon_sha256":"9251786ea474caad229bd470d7f883c371867aaa9a370cd295610c01c10f4c92"},"schema_version":"1.0","source":{"id":"1801.07808","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.07808","created_at":"2026-05-18T00:25:10Z"},{"alias_kind":"arxiv_version","alias_value":"1801.07808v1","created_at":"2026-05-18T00:25:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.07808","created_at":"2026-05-18T00:25:10Z"},{"alias_kind":"pith_short_12","alias_value":"4YNLQIHNZWKC","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_16","alias_value":"4YNLQIHNZWKCXOTM","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_8","alias_value":"4YNLQIHN","created_at":"2026-05-18T12:32:05Z"}],"graph_snapshots":[{"event_id":"sha256:7e654df9d1ad115263bf47b4f3993d685d815034d5a7a6eed3af571e05c7f029","target":"graph","created_at":"2026-05-18T00:25:10Z","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":"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","authors_text":"Franklin Kenter, Glenn Hurlbert, John Asplund","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-01-23T23:30:08Z","title":"Pebbling on Graph Products and other Binary Graph Constructions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.07808","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:c137421a34750f4916b3424eba5cc5dd78139b4829881202252ce65c2e6e5090","target":"record","created_at":"2026-05-18T00:25:10Z","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":"79c32f62a9617b69e51099fa9f60b7a8391db60d51cb24b5f9cd13a63214637a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-01-23T23:30:08Z","title_canon_sha256":"9251786ea474caad229bd470d7f883c371867aaa9a370cd295610c01c10f4c92"},"schema_version":"1.0","source":{"id":"1801.07808","kind":"arxiv","version":1}},"canonical_sha256":"e61ab820edcd942bba6c17f7f8548d9bb02f8cdbd9a1f35c73625a2921fc8d79","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e61ab820edcd942bba6c17f7f8548d9bb02f8cdbd9a1f35c73625a2921fc8d79","first_computed_at":"2026-05-18T00:25:10.793420Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:25:10.793420Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Qe+1LlusYZE0g2h2qKhtVzN73It6RQSLsQqKk9vLan+0exCrRAb4dbwVYOKT7euVV2sB0lMr/uHQXTa1sQL0Aw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:25:10.793962Z","signed_message":"canonical_sha256_bytes"},"source_id":"1801.07808","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c137421a34750f4916b3424eba5cc5dd78139b4829881202252ce65c2e6e5090","sha256:7e654df9d1ad115263bf47b4f3993d685d815034d5a7a6eed3af571e05c7f029"],"state_sha256":"d78c20347630874ca539ce832e446838aedc08bd9b235fe361cecc3c542964f4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xzVwvf5/UKIKRMHLDr0Ee4Niv2uXRh+F0pUJvUaFIb95TcGmi4Cl/2BGBZuEvo8j2v0qvoBGZtMvfqQqe3rIBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T07:42:20.261559Z","bundle_sha256":"ad751ffa01ab8e6d724a5f1da25583ef46ed0e36ffa032804c19e979cc4f2911"}}