{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:CK3KS4HIB7VALGHU667R2R3ZG4","short_pith_number":"pith:CK3KS4HI","canonical_record":{"source":{"id":"1611.09686","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-11-29T15:37:55Z","cross_cats_sorted":[],"title_canon_sha256":"893b0dc8b49ef09da9afe22d0ba39484ab13465076614c49f599e96869909814","abstract_canon_sha256":"3a294cf164afc5afa7b1545dd889bc323540b6549be9745c5a80631625bd18f8"},"schema_version":"1.0"},"canonical_sha256":"12b6a970e80fea0598f4f7bf1d4779372a861a6d3351fa57926d88b56ea4556e","source":{"kind":"arxiv","id":"1611.09686","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.09686","created_at":"2026-05-18T00:56:13Z"},{"alias_kind":"arxiv_version","alias_value":"1611.09686v1","created_at":"2026-05-18T00:56:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.09686","created_at":"2026-05-18T00:56:13Z"},{"alias_kind":"pith_short_12","alias_value":"CK3KS4HIB7VA","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_16","alias_value":"CK3KS4HIB7VALGHU","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_8","alias_value":"CK3KS4HI","created_at":"2026-05-18T12:30:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:CK3KS4HIB7VALGHU667R2R3ZG4","target":"record","payload":{"canonical_record":{"source":{"id":"1611.09686","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-11-29T15:37:55Z","cross_cats_sorted":[],"title_canon_sha256":"893b0dc8b49ef09da9afe22d0ba39484ab13465076614c49f599e96869909814","abstract_canon_sha256":"3a294cf164afc5afa7b1545dd889bc323540b6549be9745c5a80631625bd18f8"},"schema_version":"1.0"},"canonical_sha256":"12b6a970e80fea0598f4f7bf1d4779372a861a6d3351fa57926d88b56ea4556e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:56:13.289278Z","signature_b64":"t/xKBfnHjc1QGqtMuLDOTZZSMcLIjb/u7GwVsNOEOrUKuWzglPYKbYZoJOLvCEnrKd9Gs/5vbAGXW7K9UWf0AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"12b6a970e80fea0598f4f7bf1d4779372a861a6d3351fa57926d88b56ea4556e","last_reissued_at":"2026-05-18T00:56:13.288629Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:56:13.288629Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1611.09686","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:56:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aY/VdUnuM3cZ6jF2fS2aBnoOWnEcfm24IydYHhwuTBkBHJxPWS/c2SG7apzuJJw24iUcrdbffrrWH5NE01KkCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T11:18:16.085790Z"},"content_sha256":"bc478c671c8d7b58729007ddb438d84bfd39e4573f7daf05e2e63d9845f67ef1","schema_version":"1.0","event_id":"sha256:bc478c671c8d7b58729007ddb438d84bfd39e4573f7daf05e2e63d9845f67ef1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:CK3KS4HIB7VALGHU667R2R3ZG4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Optimal Pebbling Number of Staircase Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Casey Tompkins, Ervin Gy\\H{o}ri, Gyula Y. Katona, L\\'aszl\\'o F. Papp","submitted_at":"2016-11-29T15:37:55Z","abstract_excerpt":"Let G be a graph with a distribution of pebbles on its vertices. A pebbling move consists of removing two pebbles from one vertex and placing one pebble on an adjacent vertex. The optimal pebbling number of G is the smallest number of pebbles which can placed on the vertices of G such that, for any vertex v of G, there is a sequence of pebbling moves resulting in at least one pebble on v. We determine the optimal pebbling number for several classes of induced subgraphs of the square grid, which we call staircase graphs."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.09686","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:56:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0nMsFK5i86RR5ruV4CS3/sgzPB4vP35UUPO5bJAqr7zQaQywYCFP2/cCOh1gzsPRLPyXYrKyS2OUnjyD9wb+Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T11:18:16.086471Z"},"content_sha256":"0e5be2df95f7f4df0c5577e84fafb0d989c6eb78bec88fbacbdf3c073718cc08","schema_version":"1.0","event_id":"sha256:0e5be2df95f7f4df0c5577e84fafb0d989c6eb78bec88fbacbdf3c073718cc08"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CK3KS4HIB7VALGHU667R2R3ZG4/bundle.json","state_url":"https://pith.science/pith/CK3KS4HIB7VALGHU667R2R3ZG4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CK3KS4HIB7VALGHU667R2R3ZG4/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-27T11:18:16Z","links":{"resolver":"https://pith.science/pith/CK3KS4HIB7VALGHU667R2R3ZG4","bundle":"https://pith.science/pith/CK3KS4HIB7VALGHU667R2R3ZG4/bundle.json","state":"https://pith.science/pith/CK3KS4HIB7VALGHU667R2R3ZG4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CK3KS4HIB7VALGHU667R2R3ZG4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:CK3KS4HIB7VALGHU667R2R3ZG4","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":"3a294cf164afc5afa7b1545dd889bc323540b6549be9745c5a80631625bd18f8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-11-29T15:37:55Z","title_canon_sha256":"893b0dc8b49ef09da9afe22d0ba39484ab13465076614c49f599e96869909814"},"schema_version":"1.0","source":{"id":"1611.09686","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.09686","created_at":"2026-05-18T00:56:13Z"},{"alias_kind":"arxiv_version","alias_value":"1611.09686v1","created_at":"2026-05-18T00:56:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.09686","created_at":"2026-05-18T00:56:13Z"},{"alias_kind":"pith_short_12","alias_value":"CK3KS4HIB7VA","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_16","alias_value":"CK3KS4HIB7VALGHU","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_8","alias_value":"CK3KS4HI","created_at":"2026-05-18T12:30:09Z"}],"graph_snapshots":[{"event_id":"sha256:0e5be2df95f7f4df0c5577e84fafb0d989c6eb78bec88fbacbdf3c073718cc08","target":"graph","created_at":"2026-05-18T00:56:13Z","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":"Let G be a graph with a distribution of pebbles on its vertices. A pebbling move consists of removing two pebbles from one vertex and placing one pebble on an adjacent vertex. The optimal pebbling number of G is the smallest number of pebbles which can placed on the vertices of G such that, for any vertex v of G, there is a sequence of pebbling moves resulting in at least one pebble on v. We determine the optimal pebbling number for several classes of induced subgraphs of the square grid, which we call staircase graphs.","authors_text":"Casey Tompkins, Ervin Gy\\H{o}ri, 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":"2016-11-29T15:37:55Z","title":"The Optimal Pebbling Number of Staircase Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.09686","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:bc478c671c8d7b58729007ddb438d84bfd39e4573f7daf05e2e63d9845f67ef1","target":"record","created_at":"2026-05-18T00:56:13Z","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":"3a294cf164afc5afa7b1545dd889bc323540b6549be9745c5a80631625bd18f8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-11-29T15:37:55Z","title_canon_sha256":"893b0dc8b49ef09da9afe22d0ba39484ab13465076614c49f599e96869909814"},"schema_version":"1.0","source":{"id":"1611.09686","kind":"arxiv","version":1}},"canonical_sha256":"12b6a970e80fea0598f4f7bf1d4779372a861a6d3351fa57926d88b56ea4556e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"12b6a970e80fea0598f4f7bf1d4779372a861a6d3351fa57926d88b56ea4556e","first_computed_at":"2026-05-18T00:56:13.288629Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:56:13.288629Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"t/xKBfnHjc1QGqtMuLDOTZZSMcLIjb/u7GwVsNOEOrUKuWzglPYKbYZoJOLvCEnrKd9Gs/5vbAGXW7K9UWf0AQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:56:13.289278Z","signed_message":"canonical_sha256_bytes"},"source_id":"1611.09686","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bc478c671c8d7b58729007ddb438d84bfd39e4573f7daf05e2e63d9845f67ef1","sha256:0e5be2df95f7f4df0c5577e84fafb0d989c6eb78bec88fbacbdf3c073718cc08"],"state_sha256":"7ba3670cc13c2a669773d2818dc936b501af2f7e520ef6c222eddde22e676f9d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AwVvTT4VtJ65lsqH+uBvL8n+mFSQAAJPTDnRdTTU4f8PrAVz7Km3+cNirSyQmUV5yW6mMzmh4Ecg5REx8pqnCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T11:18:16.089811Z","bundle_sha256":"41888713e088c42ad7366dd9a56f6cbeb1af6dd567f9ba4f66390432779aeacb"}}