{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:K45CDOGATX25PVABQXA4B7KPY7","short_pith_number":"pith:K45CDOGA","canonical_record":{"source":{"id":"1604.04045","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-04-14T06:41:19Z","cross_cats_sorted":[],"title_canon_sha256":"dc6946b80405ec166dafb92b39fae04f3cfa450e8bef03d0f1eaf1d262a97320","abstract_canon_sha256":"d2fa3ff851f2e95966fa797024723233ce888b88f90e13292ae69f9ac21d635a"},"schema_version":"1.0"},"canonical_sha256":"573a21b8c09df5d7d40185c1c0fd4fc7f12d694d8ba7d84ba0efa88779a8082b","source":{"kind":"arxiv","id":"1604.04045","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.04045","created_at":"2026-05-18T00:52:50Z"},{"alias_kind":"arxiv_version","alias_value":"1604.04045v2","created_at":"2026-05-18T00:52:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.04045","created_at":"2026-05-18T00:52:50Z"},{"alias_kind":"pith_short_12","alias_value":"K45CDOGATX25","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_16","alias_value":"K45CDOGATX25PVAB","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_8","alias_value":"K45CDOGA","created_at":"2026-05-18T12:30:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:K45CDOGATX25PVABQXA4B7KPY7","target":"record","payload":{"canonical_record":{"source":{"id":"1604.04045","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-04-14T06:41:19Z","cross_cats_sorted":[],"title_canon_sha256":"dc6946b80405ec166dafb92b39fae04f3cfa450e8bef03d0f1eaf1d262a97320","abstract_canon_sha256":"d2fa3ff851f2e95966fa797024723233ce888b88f90e13292ae69f9ac21d635a"},"schema_version":"1.0"},"canonical_sha256":"573a21b8c09df5d7d40185c1c0fd4fc7f12d694d8ba7d84ba0efa88779a8082b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:52:50.384477Z","signature_b64":"HPwf6sLsYvgQ16XdmwjD+xLelXKPSC042OZetshohmekOoUUI2SUuBXR4j5TKHdyZT1NsnnZULKwOVfGCRFuBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"573a21b8c09df5d7d40185c1c0fd4fc7f12d694d8ba7d84ba0efa88779a8082b","last_reissued_at":"2026-05-18T00:52:50.383819Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:52:50.383819Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1604.04045","source_version":2,"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:52:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yTcw4vQmx5jqU5AFJMHTVuJO4eoyEvuTCk5bHv9OPYEWLyAXgArBRKrL5tllDofSwR5huiGqr0OJ6/cu35cmCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T12:48:13.462183Z"},"content_sha256":"dc2894c637d60ea8bdbeb9a39cb2af7d4da8032a42e51709a2e4c462ba96adbf","schema_version":"1.0","event_id":"sha256:dc2894c637d60ea8bdbeb9a39cb2af7d4da8032a42e51709a2e4c462ba96adbf"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:K45CDOGATX25PVABQXA4B7KPY7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Pebbling in Semi-2-Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Glenn Hurlbert, Liliana Alc\\'on, Marisa Gutierrez","submitted_at":"2016-04-14T06:41:19Z","abstract_excerpt":"Graph pebbling is a network model for transporting discrete resources that are consumed in transit. Deciding whether a given configuration on a particular graph can reach a specified target is ${\\sf NP}$-complete, even for diameter two graphs, and deciding whether the pebbling number has a prescribed upper bound is $\\Pi_2^{\\sf P}$-complete. Recently we proved that the pebbling number of a split graph can be computed in polynomial time. This paper advances the program of finding other polynomial classes, moving away from the large tree width, small diameter case (such as split graphs) to small "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.04045","kind":"arxiv","version":2},"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:52:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aJNCwXkxSVqj7UIPznfM5PmyO746vM/0WDMhlNqm2sTw6YvlXA65G+O7tqZVGT3AhruKuWc05vH+fiTF5UgEBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T12:48:13.462541Z"},"content_sha256":"2757772afb3cb1d26baf02be7de27e878e7fcbe961de0e55649f24288deb4fc0","schema_version":"1.0","event_id":"sha256:2757772afb3cb1d26baf02be7de27e878e7fcbe961de0e55649f24288deb4fc0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/K45CDOGATX25PVABQXA4B7KPY7/bundle.json","state_url":"https://pith.science/pith/K45CDOGATX25PVABQXA4B7KPY7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/K45CDOGATX25PVABQXA4B7KPY7/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-05T12:48:13Z","links":{"resolver":"https://pith.science/pith/K45CDOGATX25PVABQXA4B7KPY7","bundle":"https://pith.science/pith/K45CDOGATX25PVABQXA4B7KPY7/bundle.json","state":"https://pith.science/pith/K45CDOGATX25PVABQXA4B7KPY7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/K45CDOGATX25PVABQXA4B7KPY7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:K45CDOGATX25PVABQXA4B7KPY7","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":"d2fa3ff851f2e95966fa797024723233ce888b88f90e13292ae69f9ac21d635a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-04-14T06:41:19Z","title_canon_sha256":"dc6946b80405ec166dafb92b39fae04f3cfa450e8bef03d0f1eaf1d262a97320"},"schema_version":"1.0","source":{"id":"1604.04045","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.04045","created_at":"2026-05-18T00:52:50Z"},{"alias_kind":"arxiv_version","alias_value":"1604.04045v2","created_at":"2026-05-18T00:52:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.04045","created_at":"2026-05-18T00:52:50Z"},{"alias_kind":"pith_short_12","alias_value":"K45CDOGATX25","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_16","alias_value":"K45CDOGATX25PVAB","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_8","alias_value":"K45CDOGA","created_at":"2026-05-18T12:30:25Z"}],"graph_snapshots":[{"event_id":"sha256:2757772afb3cb1d26baf02be7de27e878e7fcbe961de0e55649f24288deb4fc0","target":"graph","created_at":"2026-05-18T00:52:50Z","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":"Graph pebbling is a network model for transporting discrete resources that are consumed in transit. Deciding whether a given configuration on a particular graph can reach a specified target is ${\\sf NP}$-complete, even for diameter two graphs, and deciding whether the pebbling number has a prescribed upper bound is $\\Pi_2^{\\sf P}$-complete. Recently we proved that the pebbling number of a split graph can be computed in polynomial time. This paper advances the program of finding other polynomial classes, moving away from the large tree width, small diameter case (such as split graphs) to small ","authors_text":"Glenn Hurlbert, Liliana Alc\\'on, Marisa Gutierrez","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-04-14T06:41:19Z","title":"Pebbling in Semi-2-Trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.04045","kind":"arxiv","version":2},"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:dc2894c637d60ea8bdbeb9a39cb2af7d4da8032a42e51709a2e4c462ba96adbf","target":"record","created_at":"2026-05-18T00:52:50Z","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":"d2fa3ff851f2e95966fa797024723233ce888b88f90e13292ae69f9ac21d635a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-04-14T06:41:19Z","title_canon_sha256":"dc6946b80405ec166dafb92b39fae04f3cfa450e8bef03d0f1eaf1d262a97320"},"schema_version":"1.0","source":{"id":"1604.04045","kind":"arxiv","version":2}},"canonical_sha256":"573a21b8c09df5d7d40185c1c0fd4fc7f12d694d8ba7d84ba0efa88779a8082b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"573a21b8c09df5d7d40185c1c0fd4fc7f12d694d8ba7d84ba0efa88779a8082b","first_computed_at":"2026-05-18T00:52:50.383819Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:52:50.383819Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"HPwf6sLsYvgQ16XdmwjD+xLelXKPSC042OZetshohmekOoUUI2SUuBXR4j5TKHdyZT1NsnnZULKwOVfGCRFuBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:52:50.384477Z","signed_message":"canonical_sha256_bytes"},"source_id":"1604.04045","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:dc2894c637d60ea8bdbeb9a39cb2af7d4da8032a42e51709a2e4c462ba96adbf","sha256:2757772afb3cb1d26baf02be7de27e878e7fcbe961de0e55649f24288deb4fc0"],"state_sha256":"4d9871965ed593b5f928f446805c376f82ff0d4af8efda33924b23b53fc815e8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YGX2Xwqu0txWvnPZnXgOAg/EOVFmUCFwbIV5J+x8IpX79PlMY2IwMfHKmMXOCkxwLKvNJAF0rrF6NqMndaJfDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T12:48:13.464737Z","bundle_sha256":"6d3f9b307e0cd844fae39aaa85c0452b1d88ac0afca6a5676d069ee5005d6f43"}}