{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:L5ESDF5ZPBJYQ4COBGCPYD5QB3","short_pith_number":"pith:L5ESDF5Z","canonical_record":{"source":{"id":"1106.5845","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-06-29T05:58:37Z","cross_cats_sorted":[],"title_canon_sha256":"34d67cdeb4737237a9be575ca3b1c9e51ade9d6258a802975839dd492199f3ca","abstract_canon_sha256":"7e1cb2bed4c8246b14a9c3c6d7c64fa873c83a59eadf05f19a1cb1f8693ec411"},"schema_version":"1.0"},"canonical_sha256":"5f492197b9785388704e0984fc0fb00ed899aaa3b5837b1394c318e6231a0621","source":{"kind":"arxiv","id":"1106.5845","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1106.5845","created_at":"2026-05-18T04:19:05Z"},{"alias_kind":"arxiv_version","alias_value":"1106.5845v1","created_at":"2026-05-18T04:19:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1106.5845","created_at":"2026-05-18T04:19:05Z"},{"alias_kind":"pith_short_12","alias_value":"L5ESDF5ZPBJY","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_16","alias_value":"L5ESDF5ZPBJYQ4CO","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_8","alias_value":"L5ESDF5Z","created_at":"2026-05-18T12:26:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:L5ESDF5ZPBJYQ4COBGCPYD5QB3","target":"record","payload":{"canonical_record":{"source":{"id":"1106.5845","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-06-29T05:58:37Z","cross_cats_sorted":[],"title_canon_sha256":"34d67cdeb4737237a9be575ca3b1c9e51ade9d6258a802975839dd492199f3ca","abstract_canon_sha256":"7e1cb2bed4c8246b14a9c3c6d7c64fa873c83a59eadf05f19a1cb1f8693ec411"},"schema_version":"1.0"},"canonical_sha256":"5f492197b9785388704e0984fc0fb00ed899aaa3b5837b1394c318e6231a0621","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:19:05.058975Z","signature_b64":"dv9qI6jYFj8HcCiQtOR+GdvGUgYetT1FkLbozCw+PLLFC8ZwgfpkcBpggw9Ume7qdH/Zldj+pNWtMNZMEXe8Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5f492197b9785388704e0984fc0fb00ed899aaa3b5837b1394c318e6231a0621","last_reissued_at":"2026-05-18T04:19:05.058339Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:19:05.058339Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1106.5845","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-18T04:19:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4edcd91OMRQx9LyngyiZkRoonogPic2ZpXZ79mZUSslV9y0gKFh1HoG76GrIWOlx5+8WPVMB8JN8hnaV4lbyBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T10:35:42.147238Z"},"content_sha256":"34f5742b06027610e8e00d30eaf33c566ff7f8c5ef3211f7de3e80da0291b3e0","schema_version":"1.0","event_id":"sha256:34f5742b06027610e8e00d30eaf33c566ff7f8c5ef3211f7de3e80da0291b3e0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:L5ESDF5ZPBJYQ4COBGCPYD5QB3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Minimum Certificate Dispersal with Tree Structures","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Hirotaka Ono, Koichi Wada, Taisuke Izumi, Tomoko Izumi","submitted_at":"2011-06-29T05:58:37Z","abstract_excerpt":"Given an n-vertex graph G=(V,E) and a set R \\subseteq {{x,y} | x,y \\in V} of requests, we consider to assign a set of edges to each vertex in G so that for every request {u, v} in R the union of the edge sets assigned to u and v contains a path from u to v. The Minimum Certificate Dispersal Problem (MCD) is defined as one to find an assignment that minimizes the sum of the cardinality of the edge set assigned to each vertex. This problem has been shown to be LOGAPX-complete for the most general setting, and APX-hard and 2-approximable in polynomial time for dense request sets, where R forms a "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1106.5845","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-18T04:19:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OCI9Yq4buQ+MpZYFjM32nW9fJbzbD0w2M/oIQE6Bg0uRregXKrE3MJRwBljXpnYUzoh0Dl5ws71Wr2nOWpK7CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T10:35:42.147910Z"},"content_sha256":"58908a6467b1be46c4882a69afc4a6111368ac4d6cf4d6151e3c63445517631e","schema_version":"1.0","event_id":"sha256:58908a6467b1be46c4882a69afc4a6111368ac4d6cf4d6151e3c63445517631e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/L5ESDF5ZPBJYQ4COBGCPYD5QB3/bundle.json","state_url":"https://pith.science/pith/L5ESDF5ZPBJYQ4COBGCPYD5QB3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/L5ESDF5ZPBJYQ4COBGCPYD5QB3/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-31T10:35:42Z","links":{"resolver":"https://pith.science/pith/L5ESDF5ZPBJYQ4COBGCPYD5QB3","bundle":"https://pith.science/pith/L5ESDF5ZPBJYQ4COBGCPYD5QB3/bundle.json","state":"https://pith.science/pith/L5ESDF5ZPBJYQ4COBGCPYD5QB3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/L5ESDF5ZPBJYQ4COBGCPYD5QB3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:L5ESDF5ZPBJYQ4COBGCPYD5QB3","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":"7e1cb2bed4c8246b14a9c3c6d7c64fa873c83a59eadf05f19a1cb1f8693ec411","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-06-29T05:58:37Z","title_canon_sha256":"34d67cdeb4737237a9be575ca3b1c9e51ade9d6258a802975839dd492199f3ca"},"schema_version":"1.0","source":{"id":"1106.5845","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1106.5845","created_at":"2026-05-18T04:19:05Z"},{"alias_kind":"arxiv_version","alias_value":"1106.5845v1","created_at":"2026-05-18T04:19:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1106.5845","created_at":"2026-05-18T04:19:05Z"},{"alias_kind":"pith_short_12","alias_value":"L5ESDF5ZPBJY","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_16","alias_value":"L5ESDF5ZPBJYQ4CO","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_8","alias_value":"L5ESDF5Z","created_at":"2026-05-18T12:26:34Z"}],"graph_snapshots":[{"event_id":"sha256:58908a6467b1be46c4882a69afc4a6111368ac4d6cf4d6151e3c63445517631e","target":"graph","created_at":"2026-05-18T04:19:05Z","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":"Given an n-vertex graph G=(V,E) and a set R \\subseteq {{x,y} | x,y \\in V} of requests, we consider to assign a set of edges to each vertex in G so that for every request {u, v} in R the union of the edge sets assigned to u and v contains a path from u to v. The Minimum Certificate Dispersal Problem (MCD) is defined as one to find an assignment that minimizes the sum of the cardinality of the edge set assigned to each vertex. This problem has been shown to be LOGAPX-complete for the most general setting, and APX-hard and 2-approximable in polynomial time for dense request sets, where R forms a ","authors_text":"Hirotaka Ono, Koichi Wada, Taisuke Izumi, Tomoko Izumi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-06-29T05:58:37Z","title":"Minimum Certificate Dispersal with Tree Structures"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1106.5845","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:34f5742b06027610e8e00d30eaf33c566ff7f8c5ef3211f7de3e80da0291b3e0","target":"record","created_at":"2026-05-18T04:19:05Z","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":"7e1cb2bed4c8246b14a9c3c6d7c64fa873c83a59eadf05f19a1cb1f8693ec411","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-06-29T05:58:37Z","title_canon_sha256":"34d67cdeb4737237a9be575ca3b1c9e51ade9d6258a802975839dd492199f3ca"},"schema_version":"1.0","source":{"id":"1106.5845","kind":"arxiv","version":1}},"canonical_sha256":"5f492197b9785388704e0984fc0fb00ed899aaa3b5837b1394c318e6231a0621","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5f492197b9785388704e0984fc0fb00ed899aaa3b5837b1394c318e6231a0621","first_computed_at":"2026-05-18T04:19:05.058339Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:19:05.058339Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"dv9qI6jYFj8HcCiQtOR+GdvGUgYetT1FkLbozCw+PLLFC8ZwgfpkcBpggw9Ume7qdH/Zldj+pNWtMNZMEXe8Aw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:19:05.058975Z","signed_message":"canonical_sha256_bytes"},"source_id":"1106.5845","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:34f5742b06027610e8e00d30eaf33c566ff7f8c5ef3211f7de3e80da0291b3e0","sha256:58908a6467b1be46c4882a69afc4a6111368ac4d6cf4d6151e3c63445517631e"],"state_sha256":"c47842c922ab289ba91fa087ba82eb82fd756cda53bb8cad79f4f17fee541ae6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aUhXG6/FUN5D/jNwfle0GhAs/N7BPj9MCWd7zGfJ44dTq3imAAzMSmh0Xf5U8y3aqOmSJvD/7DilPo7spUBTDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T10:35:42.151341Z","bundle_sha256":"6afe10a5ebbe1571330288bd661053e21753653a6719c1d58d2a5920bbdfe4f4"}}