{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:T3A3E4TLMQMKPECVJ2KUWLMJ5U","short_pith_number":"pith:T3A3E4TL","canonical_record":{"source":{"id":"1602.04102","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2016-02-12T16:20:23Z","cross_cats_sorted":["stat.TH"],"title_canon_sha256":"9d097eccac4a862bf77b2bf4260a8a3adb8e649fcc3519560efa87d1b5dc8851","abstract_canon_sha256":"77ad0a1810e0a2f22c7cb684af7ac5d05c04053d96950424a2692bc745d6a603"},"schema_version":"1.0"},"canonical_sha256":"9ec1b2726b6418a790554e954b2d89ed3d623430a1b4c1d98a05c3bf91b476c7","source":{"kind":"arxiv","id":"1602.04102","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.04102","created_at":"2026-05-18T01:09:06Z"},{"alias_kind":"arxiv_version","alias_value":"1602.04102v2","created_at":"2026-05-18T01:09:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.04102","created_at":"2026-05-18T01:09:06Z"},{"alias_kind":"pith_short_12","alias_value":"T3A3E4TLMQMK","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_16","alias_value":"T3A3E4TLMQMKPECV","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_8","alias_value":"T3A3E4TL","created_at":"2026-05-18T12:30:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:T3A3E4TLMQMKPECVJ2KUWLMJ5U","target":"record","payload":{"canonical_record":{"source":{"id":"1602.04102","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2016-02-12T16:20:23Z","cross_cats_sorted":["stat.TH"],"title_canon_sha256":"9d097eccac4a862bf77b2bf4260a8a3adb8e649fcc3519560efa87d1b5dc8851","abstract_canon_sha256":"77ad0a1810e0a2f22c7cb684af7ac5d05c04053d96950424a2692bc745d6a603"},"schema_version":"1.0"},"canonical_sha256":"9ec1b2726b6418a790554e954b2d89ed3d623430a1b4c1d98a05c3bf91b476c7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:09:06.717699Z","signature_b64":"BtUoj6lj7HGkpEJprns86PTtDBVT0ZFQqdUsCMJZ6DtVj4+SPMN2KWjn8u8d+XKkosz4t+lmSwGSKGJKRgmLCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9ec1b2726b6418a790554e954b2d89ed3d623430a1b4c1d98a05c3bf91b476c7","last_reissued_at":"2026-05-18T01:09:06.717188Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:09:06.717188Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1602.04102","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-18T01:09:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"60ymCgHtMiObWM1JGEl2sF0hjNmBrWNRsP7bl7+/r42p5FWczZ/qxxhEircS0vnfozSxN9FSntqhGq/i7oXsAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T02:50:06.825698Z"},"content_sha256":"6b780602f7a3b0d3e79316f93861430a0109d805eeb5fef5d5f3310a630f623e","schema_version":"1.0","event_id":"sha256:6b780602f7a3b0d3e79316f93861430a0109d805eeb5fef5d5f3310a630f623e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:T3A3E4TLMQMKPECVJ2KUWLMJ5U","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Estimating perimeter using graph cuts","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.TH"],"primary_cat":"math.ST","authors_text":"Dejan Slep\\v{c}ev, James von Brecht, Nicol\\'as Garc\\'ia Trillos","submitted_at":"2016-02-12T16:20:23Z","abstract_excerpt":"We investigate the estimation of the perimeter of a set by a graph cut of a random geometric graph. For $\\Omega \\subset D = (0,1)^d$, with $d \\geq 2$, we are given $n$ random i.i.d. points on $D$ whose membership in $\\Omega$ is known. We consider the sample as a random geometric graph with connection distance $\\varepsilon>0$. We estimate the perimeter of $\\Omega$ (relative to $D$) by the, appropriately rescaled, graph cut between the vertices in $\\Omega$ and the vertices in $D \\backslash \\Omega$. We obtain bias and variance estimates on the error, which are optimal in scaling with respect to $"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.04102","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-18T01:09:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Fvs92vHRbOK6RONCJoPRyivkodxsb4PXEdeic2gnztFMFWc8wdfmLrFkvZIMag0VHYBejbLraV02OkEGOVAiBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T02:50:06.826061Z"},"content_sha256":"0b60cfbe6186da68fb210f8ec1e30f7b816c056a960ccd4c31c1749b6dc9bc2b","schema_version":"1.0","event_id":"sha256:0b60cfbe6186da68fb210f8ec1e30f7b816c056a960ccd4c31c1749b6dc9bc2b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/T3A3E4TLMQMKPECVJ2KUWLMJ5U/bundle.json","state_url":"https://pith.science/pith/T3A3E4TLMQMKPECVJ2KUWLMJ5U/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/T3A3E4TLMQMKPECVJ2KUWLMJ5U/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-04T02:50:06Z","links":{"resolver":"https://pith.science/pith/T3A3E4TLMQMKPECVJ2KUWLMJ5U","bundle":"https://pith.science/pith/T3A3E4TLMQMKPECVJ2KUWLMJ5U/bundle.json","state":"https://pith.science/pith/T3A3E4TLMQMKPECVJ2KUWLMJ5U/state.json","well_known_bundle":"https://pith.science/.well-known/pith/T3A3E4TLMQMKPECVJ2KUWLMJ5U/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:T3A3E4TLMQMKPECVJ2KUWLMJ5U","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":"77ad0a1810e0a2f22c7cb684af7ac5d05c04053d96950424a2692bc745d6a603","cross_cats_sorted":["stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2016-02-12T16:20:23Z","title_canon_sha256":"9d097eccac4a862bf77b2bf4260a8a3adb8e649fcc3519560efa87d1b5dc8851"},"schema_version":"1.0","source":{"id":"1602.04102","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.04102","created_at":"2026-05-18T01:09:06Z"},{"alias_kind":"arxiv_version","alias_value":"1602.04102v2","created_at":"2026-05-18T01:09:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.04102","created_at":"2026-05-18T01:09:06Z"},{"alias_kind":"pith_short_12","alias_value":"T3A3E4TLMQMK","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_16","alias_value":"T3A3E4TLMQMKPECV","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_8","alias_value":"T3A3E4TL","created_at":"2026-05-18T12:30:44Z"}],"graph_snapshots":[{"event_id":"sha256:0b60cfbe6186da68fb210f8ec1e30f7b816c056a960ccd4c31c1749b6dc9bc2b","target":"graph","created_at":"2026-05-18T01:09:06Z","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 investigate the estimation of the perimeter of a set by a graph cut of a random geometric graph. For $\\Omega \\subset D = (0,1)^d$, with $d \\geq 2$, we are given $n$ random i.i.d. points on $D$ whose membership in $\\Omega$ is known. We consider the sample as a random geometric graph with connection distance $\\varepsilon>0$. We estimate the perimeter of $\\Omega$ (relative to $D$) by the, appropriately rescaled, graph cut between the vertices in $\\Omega$ and the vertices in $D \\backslash \\Omega$. We obtain bias and variance estimates on the error, which are optimal in scaling with respect to $","authors_text":"Dejan Slep\\v{c}ev, James von Brecht, Nicol\\'as Garc\\'ia Trillos","cross_cats":["stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2016-02-12T16:20:23Z","title":"Estimating perimeter using graph cuts"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.04102","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:6b780602f7a3b0d3e79316f93861430a0109d805eeb5fef5d5f3310a630f623e","target":"record","created_at":"2026-05-18T01:09:06Z","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":"77ad0a1810e0a2f22c7cb684af7ac5d05c04053d96950424a2692bc745d6a603","cross_cats_sorted":["stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2016-02-12T16:20:23Z","title_canon_sha256":"9d097eccac4a862bf77b2bf4260a8a3adb8e649fcc3519560efa87d1b5dc8851"},"schema_version":"1.0","source":{"id":"1602.04102","kind":"arxiv","version":2}},"canonical_sha256":"9ec1b2726b6418a790554e954b2d89ed3d623430a1b4c1d98a05c3bf91b476c7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9ec1b2726b6418a790554e954b2d89ed3d623430a1b4c1d98a05c3bf91b476c7","first_computed_at":"2026-05-18T01:09:06.717188Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:09:06.717188Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"BtUoj6lj7HGkpEJprns86PTtDBVT0ZFQqdUsCMJZ6DtVj4+SPMN2KWjn8u8d+XKkosz4t+lmSwGSKGJKRgmLCg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:09:06.717699Z","signed_message":"canonical_sha256_bytes"},"source_id":"1602.04102","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6b780602f7a3b0d3e79316f93861430a0109d805eeb5fef5d5f3310a630f623e","sha256:0b60cfbe6186da68fb210f8ec1e30f7b816c056a960ccd4c31c1749b6dc9bc2b"],"state_sha256":"b7dd1674c16e41caeb83061eaf6df460624af3d6961a86114f4793a91cdacfb7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oO33WPijcSGD8aGGNL6Lw6yz9lt7ALD4zAJdkPXqrROY/d6QuoWlsARBOxPuPC65VAf/iBw0+FkyK7jszTTnCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T02:50:06.828085Z","bundle_sha256":"e578f267e0eeb662149881728513cb9cab5c90fc01e1825a4aea876fe9012d3f"}}