{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:NDV2FEKJGBPGTKPX77S4RWWWOY","short_pith_number":"pith:NDV2FEKJ","canonical_record":{"source":{"id":"1310.5647","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2013-10-21T17:08:03Z","cross_cats_sorted":[],"title_canon_sha256":"a2d1a242f2e38d8447287eecf7122165a1e3edd9b8218bfbd785a886af0f3d27","abstract_canon_sha256":"ef6c2ab138bfa04791b6992ba26c07715f86ce4ec086e9b52a8cb86feb47a9a6"},"schema_version":"1.0"},"canonical_sha256":"68eba29149305e69a9f7ffe5c8dad67636ae9a2257c7c979d44c058975ccb26f","source":{"kind":"arxiv","id":"1310.5647","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.5647","created_at":"2026-05-18T03:09:34Z"},{"alias_kind":"arxiv_version","alias_value":"1310.5647v1","created_at":"2026-05-18T03:09:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.5647","created_at":"2026-05-18T03:09:34Z"},{"alias_kind":"pith_short_12","alias_value":"NDV2FEKJGBPG","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_16","alias_value":"NDV2FEKJGBPGTKPX","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_8","alias_value":"NDV2FEKJ","created_at":"2026-05-18T12:27:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:NDV2FEKJGBPGTKPX77S4RWWWOY","target":"record","payload":{"canonical_record":{"source":{"id":"1310.5647","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2013-10-21T17:08:03Z","cross_cats_sorted":[],"title_canon_sha256":"a2d1a242f2e38d8447287eecf7122165a1e3edd9b8218bfbd785a886af0f3d27","abstract_canon_sha256":"ef6c2ab138bfa04791b6992ba26c07715f86ce4ec086e9b52a8cb86feb47a9a6"},"schema_version":"1.0"},"canonical_sha256":"68eba29149305e69a9f7ffe5c8dad67636ae9a2257c7c979d44c058975ccb26f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:09:34.708668Z","signature_b64":"O4ZT921p0J+6fjjpaEaIjdOxrwTsJefDSTSyxVWbnmlo2wj7R9L/l2BJGzvkGkRmaJDC/clZDE7goQpI34+zCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"68eba29149305e69a9f7ffe5c8dad67636ae9a2257c7c979d44c058975ccb26f","last_reissued_at":"2026-05-18T03:09:34.707965Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:09:34.707965Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1310.5647","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-18T03:09:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xeV42HV7uWAtPGZY6Hc0vpnRnUc4P2pP7poLA9A3RQtm+7uKrKb4BcoBQb/moGeVuYYG8jD4p9/0TRnKXKPODg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T11:57:44.809114Z"},"content_sha256":"f250d2e90e8cacfe4a089366e1b1b7001729742d1a172e3bf39bbcfed6609a52","schema_version":"1.0","event_id":"sha256:f250d2e90e8cacfe4a089366e1b1b7001729742d1a172e3bf39bbcfed6609a52"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:NDV2FEKJGBPGTKPX77S4RWWWOY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Union of Random Minkowski Sums and Network Vulnerability Analysis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Haim Kaplan, Micha Sharir, Pankaj Agarwal, Sariel Har-Peled","submitted_at":"2013-10-21T17:08:03Z","abstract_excerpt":"Let $\\mathcal{C}=\\{C_1,\\ldots,C_n\\}$ be a set of $n$ pairwise-disjoint convex sets of constant description complexity, and let $\\pi$ be a probability density function (pdf for short) over the non-negative reals. For each $i$, let $K_i$ be the Minkowski sum of $C_i$ with a disk of radius $r_i$, where each $r_i$ is a random non-negative number drawn independently from the distribution determined by $\\pi$. We show that the expected complexity of the union of $K_1, \\ldots, K_n$ is $O(n^{1+\\varepsilon})$ for any $\\varepsilon > 0$; here the constant of proportionality depends on $\\varepsilon$ and on"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.5647","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-18T03:09:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TJiLYLZO1YixGriUygUJziO3M9CbaV89PYugp/Bjyl6He6E4Lvj2Jzk54sO5CarvivdHQgX8Nmu9l5fyZ0HeDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T11:57:44.809743Z"},"content_sha256":"0ed43a84c8eb768b3d57ab9b4332a5aea89ab260348beeb98f77a9f7814c51a6","schema_version":"1.0","event_id":"sha256:0ed43a84c8eb768b3d57ab9b4332a5aea89ab260348beeb98f77a9f7814c51a6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NDV2FEKJGBPGTKPX77S4RWWWOY/bundle.json","state_url":"https://pith.science/pith/NDV2FEKJGBPGTKPX77S4RWWWOY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NDV2FEKJGBPGTKPX77S4RWWWOY/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-30T11:57:44Z","links":{"resolver":"https://pith.science/pith/NDV2FEKJGBPGTKPX77S4RWWWOY","bundle":"https://pith.science/pith/NDV2FEKJGBPGTKPX77S4RWWWOY/bundle.json","state":"https://pith.science/pith/NDV2FEKJGBPGTKPX77S4RWWWOY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NDV2FEKJGBPGTKPX77S4RWWWOY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:NDV2FEKJGBPGTKPX77S4RWWWOY","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":"ef6c2ab138bfa04791b6992ba26c07715f86ce4ec086e9b52a8cb86feb47a9a6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2013-10-21T17:08:03Z","title_canon_sha256":"a2d1a242f2e38d8447287eecf7122165a1e3edd9b8218bfbd785a886af0f3d27"},"schema_version":"1.0","source":{"id":"1310.5647","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.5647","created_at":"2026-05-18T03:09:34Z"},{"alias_kind":"arxiv_version","alias_value":"1310.5647v1","created_at":"2026-05-18T03:09:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.5647","created_at":"2026-05-18T03:09:34Z"},{"alias_kind":"pith_short_12","alias_value":"NDV2FEKJGBPG","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_16","alias_value":"NDV2FEKJGBPGTKPX","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_8","alias_value":"NDV2FEKJ","created_at":"2026-05-18T12:27:52Z"}],"graph_snapshots":[{"event_id":"sha256:0ed43a84c8eb768b3d57ab9b4332a5aea89ab260348beeb98f77a9f7814c51a6","target":"graph","created_at":"2026-05-18T03:09:34Z","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":"Let $\\mathcal{C}=\\{C_1,\\ldots,C_n\\}$ be a set of $n$ pairwise-disjoint convex sets of constant description complexity, and let $\\pi$ be a probability density function (pdf for short) over the non-negative reals. For each $i$, let $K_i$ be the Minkowski sum of $C_i$ with a disk of radius $r_i$, where each $r_i$ is a random non-negative number drawn independently from the distribution determined by $\\pi$. We show that the expected complexity of the union of $K_1, \\ldots, K_n$ is $O(n^{1+\\varepsilon})$ for any $\\varepsilon > 0$; here the constant of proportionality depends on $\\varepsilon$ and on","authors_text":"Haim Kaplan, Micha Sharir, Pankaj Agarwal, Sariel Har-Peled","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2013-10-21T17:08:03Z","title":"Union of Random Minkowski Sums and Network Vulnerability Analysis"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.5647","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:f250d2e90e8cacfe4a089366e1b1b7001729742d1a172e3bf39bbcfed6609a52","target":"record","created_at":"2026-05-18T03:09:34Z","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":"ef6c2ab138bfa04791b6992ba26c07715f86ce4ec086e9b52a8cb86feb47a9a6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2013-10-21T17:08:03Z","title_canon_sha256":"a2d1a242f2e38d8447287eecf7122165a1e3edd9b8218bfbd785a886af0f3d27"},"schema_version":"1.0","source":{"id":"1310.5647","kind":"arxiv","version":1}},"canonical_sha256":"68eba29149305e69a9f7ffe5c8dad67636ae9a2257c7c979d44c058975ccb26f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"68eba29149305e69a9f7ffe5c8dad67636ae9a2257c7c979d44c058975ccb26f","first_computed_at":"2026-05-18T03:09:34.707965Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:09:34.707965Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"O4ZT921p0J+6fjjpaEaIjdOxrwTsJefDSTSyxVWbnmlo2wj7R9L/l2BJGzvkGkRmaJDC/clZDE7goQpI34+zCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:09:34.708668Z","signed_message":"canonical_sha256_bytes"},"source_id":"1310.5647","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f250d2e90e8cacfe4a089366e1b1b7001729742d1a172e3bf39bbcfed6609a52","sha256:0ed43a84c8eb768b3d57ab9b4332a5aea89ab260348beeb98f77a9f7814c51a6"],"state_sha256":"9e739b259374d70a3f4a44d4801425a806ea6519e637914ebe708ef17668c46c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bLcLTWU/bi/5/oaLsrkJmBJS095rJa80i7d4/5nCwfhv+RLoBYBe4lk0PorFMN5yFsKVoE8M9pvlg7pcbpjgCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T11:57:44.812676Z","bundle_sha256":"b8192a29d92f29a0af3973950bff7b19cdb0ddd225bd409a25ad4d29f2e24eec"}}