{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:AHCNMXIL4S7OXHZU5J4LWGRWBE","short_pith_number":"pith:AHCNMXIL","canonical_record":{"source":{"id":"1609.04449","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2016-09-14T21:22:51Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"b25eba1807d2b564cce62a85c75c147d35839b1e170463f29cd5b92ef0cd9f44","abstract_canon_sha256":"670103053d8def470e195404f7c33ae3989d9c6521c163010756350352a137d5"},"schema_version":"1.0"},"canonical_sha256":"01c4d65d0be4beeb9f34ea78bb1a36090502772ae486f77c386fddfe41ee9cbc","source":{"kind":"arxiv","id":"1609.04449","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.04449","created_at":"2026-05-18T00:25:27Z"},{"alias_kind":"arxiv_version","alias_value":"1609.04449v2","created_at":"2026-05-18T00:25:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.04449","created_at":"2026-05-18T00:25:27Z"},{"alias_kind":"pith_short_12","alias_value":"AHCNMXIL4S7O","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_16","alias_value":"AHCNMXIL4S7OXHZU","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_8","alias_value":"AHCNMXIL","created_at":"2026-05-18T12:30:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:AHCNMXIL4S7OXHZU5J4LWGRWBE","target":"record","payload":{"canonical_record":{"source":{"id":"1609.04449","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2016-09-14T21:22:51Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"b25eba1807d2b564cce62a85c75c147d35839b1e170463f29cd5b92ef0cd9f44","abstract_canon_sha256":"670103053d8def470e195404f7c33ae3989d9c6521c163010756350352a137d5"},"schema_version":"1.0"},"canonical_sha256":"01c4d65d0be4beeb9f34ea78bb1a36090502772ae486f77c386fddfe41ee9cbc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:25:27.191750Z","signature_b64":"GjSqW/MRqe8KTWTD3buTsuLClH7SGi5BMOL95kw1itfFgE3y3GT5tRUqlh3qzbAmi+HK5aJA3JU2cqt2Ol7UDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"01c4d65d0be4beeb9f34ea78bb1a36090502772ae486f77c386fddfe41ee9cbc","last_reissued_at":"2026-05-18T00:25:27.191195Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:25:27.191195Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1609.04449","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:25:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mxUxAkD1rfTQnoUI9IMdkNQMVLwYc2FI6oWBgzlgeerzygpO52q9zkzIZJlaPZih96xXWChNXopF8S5WbYCNCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T14:45:07.857897Z"},"content_sha256":"32646bc060231f98f573e42d3ebb50e36c102fd06deb73eea91976f63630e97a","schema_version":"1.0","event_id":"sha256:32646bc060231f98f573e42d3ebb50e36c102fd06deb73eea91976f63630e97a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:AHCNMXIL4S7OXHZU5J4LWGRWBE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Computational Complexity of Minimal Cumulative Cost Graph Pebbling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.CR","authors_text":"Jeremiah Blocki, Samson Zhou","submitted_at":"2016-09-14T21:22:51Z","abstract_excerpt":"We consider the computational complexity of finding a legal black pebbling of a DAG $G=(V,E)$ with minimum cumulative cost. A black pebbling is a sequence $P_0,\\ldots, P_t \\subseteq V$ of sets of nodes which must satisfy the following properties: $P_0 = \\emptyset$ (we start off with no pebbles on $G$), $\\mathsf{sinks}(G) \\subseteq \\bigcup_{j \\leq t} P_j$ (every sink node was pebbled at some point) and $\\mathsf{parents}\\big(P_{i+1}\\backslash P_i\\big) \\subseteq P_i$ (we can only place a new pebble on a node $v$ if all of $v$'s parents had a pebble during the last round). The cumulative cost of a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.04449","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:25:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"B8vO2F57IaXou8Gkjrg3/tP1tBq9eN5mwjfLrjZWvFOnmZozPZl/rp5xLLPEh2ggGIV7YTkLSo4H+Zr8OvTuCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T14:45:07.858587Z"},"content_sha256":"9f89ed0474d271d56b78e7a0c00e8e9d8e536697abafff9f206343250a9f8c3c","schema_version":"1.0","event_id":"sha256:9f89ed0474d271d56b78e7a0c00e8e9d8e536697abafff9f206343250a9f8c3c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AHCNMXIL4S7OXHZU5J4LWGRWBE/bundle.json","state_url":"https://pith.science/pith/AHCNMXIL4S7OXHZU5J4LWGRWBE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AHCNMXIL4S7OXHZU5J4LWGRWBE/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-27T14:45:07Z","links":{"resolver":"https://pith.science/pith/AHCNMXIL4S7OXHZU5J4LWGRWBE","bundle":"https://pith.science/pith/AHCNMXIL4S7OXHZU5J4LWGRWBE/bundle.json","state":"https://pith.science/pith/AHCNMXIL4S7OXHZU5J4LWGRWBE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AHCNMXIL4S7OXHZU5J4LWGRWBE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:AHCNMXIL4S7OXHZU5J4LWGRWBE","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":"670103053d8def470e195404f7c33ae3989d9c6521c163010756350352a137d5","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2016-09-14T21:22:51Z","title_canon_sha256":"b25eba1807d2b564cce62a85c75c147d35839b1e170463f29cd5b92ef0cd9f44"},"schema_version":"1.0","source":{"id":"1609.04449","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.04449","created_at":"2026-05-18T00:25:27Z"},{"alias_kind":"arxiv_version","alias_value":"1609.04449v2","created_at":"2026-05-18T00:25:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.04449","created_at":"2026-05-18T00:25:27Z"},{"alias_kind":"pith_short_12","alias_value":"AHCNMXIL4S7O","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_16","alias_value":"AHCNMXIL4S7OXHZU","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_8","alias_value":"AHCNMXIL","created_at":"2026-05-18T12:30:07Z"}],"graph_snapshots":[{"event_id":"sha256:9f89ed0474d271d56b78e7a0c00e8e9d8e536697abafff9f206343250a9f8c3c","target":"graph","created_at":"2026-05-18T00:25:27Z","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":"We consider the computational complexity of finding a legal black pebbling of a DAG $G=(V,E)$ with minimum cumulative cost. A black pebbling is a sequence $P_0,\\ldots, P_t \\subseteq V$ of sets of nodes which must satisfy the following properties: $P_0 = \\emptyset$ (we start off with no pebbles on $G$), $\\mathsf{sinks}(G) \\subseteq \\bigcup_{j \\leq t} P_j$ (every sink node was pebbled at some point) and $\\mathsf{parents}\\big(P_{i+1}\\backslash P_i\\big) \\subseteq P_i$ (we can only place a new pebble on a node $v$ if all of $v$'s parents had a pebble during the last round). The cumulative cost of a","authors_text":"Jeremiah Blocki, Samson Zhou","cross_cats":["cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2016-09-14T21:22:51Z","title":"On the Computational Complexity of Minimal Cumulative Cost Graph Pebbling"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.04449","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:32646bc060231f98f573e42d3ebb50e36c102fd06deb73eea91976f63630e97a","target":"record","created_at":"2026-05-18T00:25:27Z","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":"670103053d8def470e195404f7c33ae3989d9c6521c163010756350352a137d5","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2016-09-14T21:22:51Z","title_canon_sha256":"b25eba1807d2b564cce62a85c75c147d35839b1e170463f29cd5b92ef0cd9f44"},"schema_version":"1.0","source":{"id":"1609.04449","kind":"arxiv","version":2}},"canonical_sha256":"01c4d65d0be4beeb9f34ea78bb1a36090502772ae486f77c386fddfe41ee9cbc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"01c4d65d0be4beeb9f34ea78bb1a36090502772ae486f77c386fddfe41ee9cbc","first_computed_at":"2026-05-18T00:25:27.191195Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:25:27.191195Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"GjSqW/MRqe8KTWTD3buTsuLClH7SGi5BMOL95kw1itfFgE3y3GT5tRUqlh3qzbAmi+HK5aJA3JU2cqt2Ol7UDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:25:27.191750Z","signed_message":"canonical_sha256_bytes"},"source_id":"1609.04449","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:32646bc060231f98f573e42d3ebb50e36c102fd06deb73eea91976f63630e97a","sha256:9f89ed0474d271d56b78e7a0c00e8e9d8e536697abafff9f206343250a9f8c3c"],"state_sha256":"fdc1078e61963470320b7585161146d9c62e695e82da274b080df41f029359ea"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wVR4wf2cKbT3PwUxTlbeVPLXj7je4qd8yyfviPYf4hHYXceMV6KxTPTnfYHhnqmn/z0o00nuTVi3K7xzWOyHCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T14:45:07.862099Z","bundle_sha256":"1f62435e78d10e8454767cc6b0a79c529e974a3fba4e6e8415ce80826929b2a2"}}