{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:3Y5UQ5C526OMEC7WWDP3DX4L7V","short_pith_number":"pith:3Y5UQ5C5","schema_version":"1.0","canonical_sha256":"de3b48745dd79cc20bf6b0dfb1df8bfd4e1dc2a0d78791687f1b3a5819015b35","source":{"kind":"arxiv","id":"1211.4049","version":1},"attestation_state":"computed","paper":{"title":"Pebbling in Split Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Glenn Hurlbert, Liliana Alc\\'on, Marisa Gutierrez","submitted_at":"2012-11-16T21:57:32Z","abstract_excerpt":"Graph pebbling is a network optimization model for transporting discrete resources that are consumed in transit: the movement of two pebbles across an edge consumes one of the pebbles. The pebbling number of a graph is the fewest number of pebbles t so that, from any initial configuration of t pebbles on its vertices, one can place a pebble on any given target vertex via such pebbling steps. It is known that deciding if a given configuration on a particular graph can reach a specified target is NP-complete, even for diameter two graphs, and that deciding if the pebbling number has a prescribed"},"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":"1211.4049","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-11-16T21:57:32Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"8aa79d9564f16143c64a3c0dd68ddd708c71a7a38637a1201300c8d585c845c8","abstract_canon_sha256":"5ac71c05eb92a044760987177d558bb6f8153c4ac916262060adec427947ec3d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:40:28.184114Z","signature_b64":"LmEbxRzauqP1AKkAH20JstpTkIMLEZ6N6MgvamFE0QGDXpMSLt94/2r7gyB1XDh5R9PIg9D4CnCcqpHprVpNAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"de3b48745dd79cc20bf6b0dfb1df8bfd4e1dc2a0d78791687f1b3a5819015b35","last_reissued_at":"2026-05-18T03:40:28.183424Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:40:28.183424Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Pebbling in Split Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Glenn Hurlbert, Liliana Alc\\'on, Marisa Gutierrez","submitted_at":"2012-11-16T21:57:32Z","abstract_excerpt":"Graph pebbling is a network optimization model for transporting discrete resources that are consumed in transit: the movement of two pebbles across an edge consumes one of the pebbles. The pebbling number of a graph is the fewest number of pebbles t so that, from any initial configuration of t pebbles on its vertices, one can place a pebble on any given target vertex via such pebbling steps. It is known that deciding if a given configuration on a particular graph can reach a specified target is NP-complete, even for diameter two graphs, and that deciding if the pebbling number has a prescribed"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.4049","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":"1211.4049","created_at":"2026-05-18T03:40:28.183506+00:00"},{"alias_kind":"arxiv_version","alias_value":"1211.4049v1","created_at":"2026-05-18T03:40:28.183506+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.4049","created_at":"2026-05-18T03:40:28.183506+00:00"},{"alias_kind":"pith_short_12","alias_value":"3Y5UQ5C526OM","created_at":"2026-05-18T12:26:53.410803+00:00"},{"alias_kind":"pith_short_16","alias_value":"3Y5UQ5C526OMEC7W","created_at":"2026-05-18T12:26:53.410803+00:00"},{"alias_kind":"pith_short_8","alias_value":"3Y5UQ5C5","created_at":"2026-05-18T12:26:53.410803+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/3Y5UQ5C526OMEC7WWDP3DX4L7V","json":"https://pith.science/pith/3Y5UQ5C526OMEC7WWDP3DX4L7V.json","graph_json":"https://pith.science/api/pith-number/3Y5UQ5C526OMEC7WWDP3DX4L7V/graph.json","events_json":"https://pith.science/api/pith-number/3Y5UQ5C526OMEC7WWDP3DX4L7V/events.json","paper":"https://pith.science/paper/3Y5UQ5C5"},"agent_actions":{"view_html":"https://pith.science/pith/3Y5UQ5C526OMEC7WWDP3DX4L7V","download_json":"https://pith.science/pith/3Y5UQ5C526OMEC7WWDP3DX4L7V.json","view_paper":"https://pith.science/paper/3Y5UQ5C5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1211.4049&json=true","fetch_graph":"https://pith.science/api/pith-number/3Y5UQ5C526OMEC7WWDP3DX4L7V/graph.json","fetch_events":"https://pith.science/api/pith-number/3Y5UQ5C526OMEC7WWDP3DX4L7V/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3Y5UQ5C526OMEC7WWDP3DX4L7V/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3Y5UQ5C526OMEC7WWDP3DX4L7V/action/storage_attestation","attest_author":"https://pith.science/pith/3Y5UQ5C526OMEC7WWDP3DX4L7V/action/author_attestation","sign_citation":"https://pith.science/pith/3Y5UQ5C526OMEC7WWDP3DX4L7V/action/citation_signature","submit_replication":"https://pith.science/pith/3Y5UQ5C526OMEC7WWDP3DX4L7V/action/replication_record"}},"created_at":"2026-05-18T03:40:28.183506+00:00","updated_at":"2026-05-18T03:40:28.183506+00:00"}