{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:T3A3E4TLMQMKPECVJ2KUWLMJ5U","short_pith_number":"pith:T3A3E4TL","schema_version":"1.0","canonical_sha256":"9ec1b2726b6418a790554e954b2d89ed3d623430a1b4c1d98a05c3bf91b476c7","source":{"kind":"arxiv","id":"1602.04102","version":2},"attestation_state":"computed","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 $"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1602.04102","created_at":"2026-05-18T01:09:06.717269+00:00"},{"alias_kind":"arxiv_version","alias_value":"1602.04102v2","created_at":"2026-05-18T01:09:06.717269+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.04102","created_at":"2026-05-18T01:09:06.717269+00:00"},{"alias_kind":"pith_short_12","alias_value":"T3A3E4TLMQMK","created_at":"2026-05-18T12:30:44.179134+00:00"},{"alias_kind":"pith_short_16","alias_value":"T3A3E4TLMQMKPECV","created_at":"2026-05-18T12:30:44.179134+00:00"},{"alias_kind":"pith_short_8","alias_value":"T3A3E4TL","created_at":"2026-05-18T12:30:44.179134+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/T3A3E4TLMQMKPECVJ2KUWLMJ5U","json":"https://pith.science/pith/T3A3E4TLMQMKPECVJ2KUWLMJ5U.json","graph_json":"https://pith.science/api/pith-number/T3A3E4TLMQMKPECVJ2KUWLMJ5U/graph.json","events_json":"https://pith.science/api/pith-number/T3A3E4TLMQMKPECVJ2KUWLMJ5U/events.json","paper":"https://pith.science/paper/T3A3E4TL"},"agent_actions":{"view_html":"https://pith.science/pith/T3A3E4TLMQMKPECVJ2KUWLMJ5U","download_json":"https://pith.science/pith/T3A3E4TLMQMKPECVJ2KUWLMJ5U.json","view_paper":"https://pith.science/paper/T3A3E4TL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1602.04102&json=true","fetch_graph":"https://pith.science/api/pith-number/T3A3E4TLMQMKPECVJ2KUWLMJ5U/graph.json","fetch_events":"https://pith.science/api/pith-number/T3A3E4TLMQMKPECVJ2KUWLMJ5U/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/T3A3E4TLMQMKPECVJ2KUWLMJ5U/action/timestamp_anchor","attest_storage":"https://pith.science/pith/T3A3E4TLMQMKPECVJ2KUWLMJ5U/action/storage_attestation","attest_author":"https://pith.science/pith/T3A3E4TLMQMKPECVJ2KUWLMJ5U/action/author_attestation","sign_citation":"https://pith.science/pith/T3A3E4TLMQMKPECVJ2KUWLMJ5U/action/citation_signature","submit_replication":"https://pith.science/pith/T3A3E4TLMQMKPECVJ2KUWLMJ5U/action/replication_record"}},"created_at":"2026-05-18T01:09:06.717269+00:00","updated_at":"2026-05-18T01:09:06.717269+00:00"}