{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:62MI7UPD5UK7YWHOZLUXZDZP4B","short_pith_number":"pith:62MI7UPD","canonical_record":{"source":{"id":"1101.5641","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-01-28T22:18:25Z","cross_cats_sorted":[],"title_canon_sha256":"234b2946635c51540be3eb43d52d45de3bc595e81c8f7e858c753f99ce0eb95e","abstract_canon_sha256":"d2b78a4ad97ff3aabc3d10cf700222ffefa7f3b742b1d7fd91f2f1cf55a5170c"},"schema_version":"1.0"},"canonical_sha256":"f6988fd1e3ed15fc58eecae97c8f2fe069aab54c8c9e36c6c4ad2510f7161f7d","source":{"kind":"arxiv","id":"1101.5641","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1101.5641","created_at":"2026-05-18T02:22:42Z"},{"alias_kind":"arxiv_version","alias_value":"1101.5641v1","created_at":"2026-05-18T02:22:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1101.5641","created_at":"2026-05-18T02:22:42Z"},{"alias_kind":"pith_short_12","alias_value":"62MI7UPD5UK7","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_16","alias_value":"62MI7UPD5UK7YWHO","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_8","alias_value":"62MI7UPD","created_at":"2026-05-18T12:26:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:62MI7UPD5UK7YWHOZLUXZDZP4B","target":"record","payload":{"canonical_record":{"source":{"id":"1101.5641","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-01-28T22:18:25Z","cross_cats_sorted":[],"title_canon_sha256":"234b2946635c51540be3eb43d52d45de3bc595e81c8f7e858c753f99ce0eb95e","abstract_canon_sha256":"d2b78a4ad97ff3aabc3d10cf700222ffefa7f3b742b1d7fd91f2f1cf55a5170c"},"schema_version":"1.0"},"canonical_sha256":"f6988fd1e3ed15fc58eecae97c8f2fe069aab54c8c9e36c6c4ad2510f7161f7d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:22:42.151814Z","signature_b64":"0jWnXOJDgusAzqC61NiBi5AUjYsuqeB3LvH33dyF5cCH6F8CJOmz7xr81bmxyubP1ogy66Rb11YwHgSIx8ZQDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f6988fd1e3ed15fc58eecae97c8f2fe069aab54c8c9e36c6c4ad2510f7161f7d","last_reissued_at":"2026-05-18T02:22:42.151035Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:22:42.151035Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1101.5641","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-18T02:22:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"caFNwU1YkXlH4EJ0Fe724n2QD0Ho7UPX7UzYSMTeUjN2VWKMmDgXHkxZG4ORldpGAR6YZ4s/SRdGDPMvGrb9Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T01:40:46.323078Z"},"content_sha256":"f75697f890aa835f105bae8903f52b4dbf3fd1be0cf4f6f06610dac352e27e21","schema_version":"1.0","event_id":"sha256:f75697f890aa835f105bae8903f52b4dbf3fd1be0cf4f6f06610dac352e27e21"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:62MI7UPD5UK7YWHOZLUXZDZP4B","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A linear optimization technique for graph pebbling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Glenn Hurlbert","submitted_at":"2011-01-28T22:18:25Z","abstract_excerpt":"Graph pebbling is a network model for studying whether or not a given supply of discrete pebbles can satisfy a given demand via pebbling moves. A pebbling move across an edge of a graph takes two pebbles from one endpoint and places one pebble at the other endpoint; the other pebble is lost in transit as a toll. It has been shown that deciding whether a supply can meet a demand on a graph is NP-complete. The pebbling number of a graph is the smallest t such that every supply of t pebbles can satisfy every demand of one pebble. Deciding if the pebbling number is at most k is \\Pi_2^P-complete. I"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1101.5641","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-18T02:22:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UD0rv4wXyFAgP/wjZaZ2Q4kP64/6ZrwVzedQgSvtFk9Vtjay3iCqNHIWDazOgDQX3EZG4oPT9yEdyXPPbbQHCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T01:40:46.323429Z"},"content_sha256":"c0d931484eed669b7df3bc4b4767d7e804b0ba02bc3f16a94f4788074b4440a2","schema_version":"1.0","event_id":"sha256:c0d931484eed669b7df3bc4b4767d7e804b0ba02bc3f16a94f4788074b4440a2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/62MI7UPD5UK7YWHOZLUXZDZP4B/bundle.json","state_url":"https://pith.science/pith/62MI7UPD5UK7YWHOZLUXZDZP4B/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/62MI7UPD5UK7YWHOZLUXZDZP4B/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-27T01:40:46Z","links":{"resolver":"https://pith.science/pith/62MI7UPD5UK7YWHOZLUXZDZP4B","bundle":"https://pith.science/pith/62MI7UPD5UK7YWHOZLUXZDZP4B/bundle.json","state":"https://pith.science/pith/62MI7UPD5UK7YWHOZLUXZDZP4B/state.json","well_known_bundle":"https://pith.science/.well-known/pith/62MI7UPD5UK7YWHOZLUXZDZP4B/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:62MI7UPD5UK7YWHOZLUXZDZP4B","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":"d2b78a4ad97ff3aabc3d10cf700222ffefa7f3b742b1d7fd91f2f1cf55a5170c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-01-28T22:18:25Z","title_canon_sha256":"234b2946635c51540be3eb43d52d45de3bc595e81c8f7e858c753f99ce0eb95e"},"schema_version":"1.0","source":{"id":"1101.5641","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1101.5641","created_at":"2026-05-18T02:22:42Z"},{"alias_kind":"arxiv_version","alias_value":"1101.5641v1","created_at":"2026-05-18T02:22:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1101.5641","created_at":"2026-05-18T02:22:42Z"},{"alias_kind":"pith_short_12","alias_value":"62MI7UPD5UK7","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_16","alias_value":"62MI7UPD5UK7YWHO","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_8","alias_value":"62MI7UPD","created_at":"2026-05-18T12:26:22Z"}],"graph_snapshots":[{"event_id":"sha256:c0d931484eed669b7df3bc4b4767d7e804b0ba02bc3f16a94f4788074b4440a2","target":"graph","created_at":"2026-05-18T02:22:42Z","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 studying whether or not a given supply of discrete pebbles can satisfy a given demand via pebbling moves. A pebbling move across an edge of a graph takes two pebbles from one endpoint and places one pebble at the other endpoint; the other pebble is lost in transit as a toll. It has been shown that deciding whether a supply can meet a demand on a graph is NP-complete. The pebbling number of a graph is the smallest t such that every supply of t pebbles can satisfy every demand of one pebble. Deciding if the pebbling number is at most k is \\Pi_2^P-complete. I","authors_text":"Glenn Hurlbert","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-01-28T22:18:25Z","title":"A linear optimization technique for graph pebbling"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1101.5641","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:f75697f890aa835f105bae8903f52b4dbf3fd1be0cf4f6f06610dac352e27e21","target":"record","created_at":"2026-05-18T02:22:42Z","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":"d2b78a4ad97ff3aabc3d10cf700222ffefa7f3b742b1d7fd91f2f1cf55a5170c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-01-28T22:18:25Z","title_canon_sha256":"234b2946635c51540be3eb43d52d45de3bc595e81c8f7e858c753f99ce0eb95e"},"schema_version":"1.0","source":{"id":"1101.5641","kind":"arxiv","version":1}},"canonical_sha256":"f6988fd1e3ed15fc58eecae97c8f2fe069aab54c8c9e36c6c4ad2510f7161f7d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f6988fd1e3ed15fc58eecae97c8f2fe069aab54c8c9e36c6c4ad2510f7161f7d","first_computed_at":"2026-05-18T02:22:42.151035Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:22:42.151035Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0jWnXOJDgusAzqC61NiBi5AUjYsuqeB3LvH33dyF5cCH6F8CJOmz7xr81bmxyubP1ogy66Rb11YwHgSIx8ZQDw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:22:42.151814Z","signed_message":"canonical_sha256_bytes"},"source_id":"1101.5641","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f75697f890aa835f105bae8903f52b4dbf3fd1be0cf4f6f06610dac352e27e21","sha256:c0d931484eed669b7df3bc4b4767d7e804b0ba02bc3f16a94f4788074b4440a2"],"state_sha256":"89df3343e775cb2bdf9ccda4d4d85f4f3f11102b7ddf21bbee5448732e8b07d8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4Abe6q6ndl3WRFOgqp59AsWMx3sN3QqF9RKDKRQkU+o279/G9POHH2/W/jFLPl+i9jsn4qIs/JSwaNkNDb5WAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T01:40:46.325282Z","bundle_sha256":"7290829eea9067d9bc09a3bb5be6ec737e2be8d11491dba023c6486e4e9f0a25"}}