{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:Z7A3C6RIGWAYUN5WZ4NLA2FVHI","short_pith_number":"pith:Z7A3C6RI","schema_version":"1.0","canonical_sha256":"cfc1b17a2835818a37b6cf1ab068b53a06064ed9d3b340f5196ec4d741ad7048","source":{"kind":"arxiv","id":"1508.07299","version":1},"attestation_state":"computed","paper":{"title":"Modified Linear Programming and Class 0 Bounds for Graph Pebbling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Carl Yerger, Chenxiao Xue, Daniel W. Cranston, Luke Postle","submitted_at":"2015-08-28T18:11:47Z","abstract_excerpt":"Given a configuration of pebbles on the vertices of a connected graph $G$, a \\emph{pebbling move} removes two pebbles from some vertex and places one pebble on an adjacent vertex. The \\emph{pebbling number} of a graph $G$ is the smallest integer $k$ such that for each vertex $v$ and each configuration of $k$ pebbles on $G$ there is a sequence of pebbling moves that places at least one pebble on $v$.\n  First, we improve on results of Hurlbert, who introduced a linear optimization technique for graph pebbling. In particular, we use a different set of weight functions, based on graphs more genera"},"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":"1508.07299","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-08-28T18:11:47Z","cross_cats_sorted":[],"title_canon_sha256":"c81f731f64fe1ae0115064aefe8dabcbd218a5607ee15ac274f1f9074eef92ad","abstract_canon_sha256":"be71674e542f3fa8b76d7e9732c7ecb7df520092d8f9d15abadde6f6fe779dc4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:42:33.309418Z","signature_b64":"1LcOo92CAuehW52AmtqPcXxYFt8UfT1XqwaVHlbCndpBto3xxPElNGbGNGKhfSHdgHHC1y7+1Zirgz/YtVjWCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cfc1b17a2835818a37b6cf1ab068b53a06064ed9d3b340f5196ec4d741ad7048","last_reissued_at":"2026-05-18T00:42:33.308867Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:42:33.308867Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Modified Linear Programming and Class 0 Bounds for Graph Pebbling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Carl Yerger, Chenxiao Xue, Daniel W. Cranston, Luke Postle","submitted_at":"2015-08-28T18:11:47Z","abstract_excerpt":"Given a configuration of pebbles on the vertices of a connected graph $G$, a \\emph{pebbling move} removes two pebbles from some vertex and places one pebble on an adjacent vertex. The \\emph{pebbling number} of a graph $G$ is the smallest integer $k$ such that for each vertex $v$ and each configuration of $k$ pebbles on $G$ there is a sequence of pebbling moves that places at least one pebble on $v$.\n  First, we improve on results of Hurlbert, who introduced a linear optimization technique for graph pebbling. In particular, we use a different set of weight functions, based on graphs more genera"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.07299","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":"1508.07299","created_at":"2026-05-18T00:42:33.308949+00:00"},{"alias_kind":"arxiv_version","alias_value":"1508.07299v1","created_at":"2026-05-18T00:42:33.308949+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.07299","created_at":"2026-05-18T00:42:33.308949+00:00"},{"alias_kind":"pith_short_12","alias_value":"Z7A3C6RIGWAY","created_at":"2026-05-18T12:29:52.810259+00:00"},{"alias_kind":"pith_short_16","alias_value":"Z7A3C6RIGWAYUN5W","created_at":"2026-05-18T12:29:52.810259+00:00"},{"alias_kind":"pith_short_8","alias_value":"Z7A3C6RI","created_at":"2026-05-18T12:29:52.810259+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/Z7A3C6RIGWAYUN5WZ4NLA2FVHI","json":"https://pith.science/pith/Z7A3C6RIGWAYUN5WZ4NLA2FVHI.json","graph_json":"https://pith.science/api/pith-number/Z7A3C6RIGWAYUN5WZ4NLA2FVHI/graph.json","events_json":"https://pith.science/api/pith-number/Z7A3C6RIGWAYUN5WZ4NLA2FVHI/events.json","paper":"https://pith.science/paper/Z7A3C6RI"},"agent_actions":{"view_html":"https://pith.science/pith/Z7A3C6RIGWAYUN5WZ4NLA2FVHI","download_json":"https://pith.science/pith/Z7A3C6RIGWAYUN5WZ4NLA2FVHI.json","view_paper":"https://pith.science/paper/Z7A3C6RI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1508.07299&json=true","fetch_graph":"https://pith.science/api/pith-number/Z7A3C6RIGWAYUN5WZ4NLA2FVHI/graph.json","fetch_events":"https://pith.science/api/pith-number/Z7A3C6RIGWAYUN5WZ4NLA2FVHI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Z7A3C6RIGWAYUN5WZ4NLA2FVHI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Z7A3C6RIGWAYUN5WZ4NLA2FVHI/action/storage_attestation","attest_author":"https://pith.science/pith/Z7A3C6RIGWAYUN5WZ4NLA2FVHI/action/author_attestation","sign_citation":"https://pith.science/pith/Z7A3C6RIGWAYUN5WZ4NLA2FVHI/action/citation_signature","submit_replication":"https://pith.science/pith/Z7A3C6RIGWAYUN5WZ4NLA2FVHI/action/replication_record"}},"created_at":"2026-05-18T00:42:33.308949+00:00","updated_at":"2026-05-18T00:42:33.308949+00:00"}