{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:7JOLHEF6LSAXVJ3NUWJX4UAMYC","short_pith_number":"pith:7JOLHEF6","schema_version":"1.0","canonical_sha256":"fa5cb390be5c817aa76da5937e500cc0b0ae8c60fd15819d980dec4172017b61","source":{"kind":"arxiv","id":"1809.07943","version":2},"attestation_state":"computed","paper":{"title":"Total Variation Isoperimetric Profiles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG","cs.NA","math.FA","math.NA"],"primary_cat":"math.OC","authors_text":"Daryl DeFord, Hugo Lavenant, Justin Solomon, Zachary Schutzman","submitted_at":"2018-09-21T04:39:48Z","abstract_excerpt":"Applications such as political redistricting demand quantitative measures of geometric compactness to distinguish between simple and contorted shapes. While the isoperimetric quotient, or ratio of area to perimeter squared, is commonly used in practice, it is sensitive to noisy data and irrelevant geographic features like coastline. These issues are addressed in theory by the isoperimetric profile, which plots the minimum perimeter needed to inscribe regions of different prescribed areas within the boundary of a shape. Efficient algorithms for computing this profile, however, are not known in "},"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":"1809.07943","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-09-21T04:39:48Z","cross_cats_sorted":["cs.CG","cs.NA","math.FA","math.NA"],"title_canon_sha256":"b21f5bd63ca19f73946901bb8e5f8e35b4ce6e5d1223b4dd62440905ee058b73","abstract_canon_sha256":"f1ee3b7020f0ffc25939e3d155c1bb2b774ca14216e1cf5a693e3b2f7d59d088"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:00:12.870145Z","signature_b64":"ju6bG0mRzqvuVNGG7SI5dby1egHgU1AHSgr4PzqrrvxhfLKUnh7l1/hhOyJXSVc/MdWf9p8et6oBFnlWDceLDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fa5cb390be5c817aa76da5937e500cc0b0ae8c60fd15819d980dec4172017b61","last_reissued_at":"2026-07-05T00:00:12.869669Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:00:12.869669Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Total Variation Isoperimetric Profiles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG","cs.NA","math.FA","math.NA"],"primary_cat":"math.OC","authors_text":"Daryl DeFord, Hugo Lavenant, Justin Solomon, Zachary Schutzman","submitted_at":"2018-09-21T04:39:48Z","abstract_excerpt":"Applications such as political redistricting demand quantitative measures of geometric compactness to distinguish between simple and contorted shapes. While the isoperimetric quotient, or ratio of area to perimeter squared, is commonly used in practice, it is sensitive to noisy data and irrelevant geographic features like coastline. These issues are addressed in theory by the isoperimetric profile, which plots the minimum perimeter needed to inscribe regions of different prescribed areas within the boundary of a shape. Efficient algorithms for computing this profile, however, are not known in "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.07943","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1809.07943/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"1809.07943","created_at":"2026-07-05T00:00:12.869729+00:00"},{"alias_kind":"arxiv_version","alias_value":"1809.07943v2","created_at":"2026-07-05T00:00:12.869729+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.07943","created_at":"2026-07-05T00:00:12.869729+00:00"},{"alias_kind":"pith_short_12","alias_value":"7JOLHEF6LSAX","created_at":"2026-07-05T00:00:12.869729+00:00"},{"alias_kind":"pith_short_16","alias_value":"7JOLHEF6LSAXVJ3N","created_at":"2026-07-05T00:00:12.869729+00:00"},{"alias_kind":"pith_short_8","alias_value":"7JOLHEF6","created_at":"2026-07-05T00:00:12.869729+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1908.08881","citing_title":"Complexity and Geometry of Sampling Connected Graph Partitions","ref_index":37,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/7JOLHEF6LSAXVJ3NUWJX4UAMYC","json":"https://pith.science/pith/7JOLHEF6LSAXVJ3NUWJX4UAMYC.json","graph_json":"https://pith.science/api/pith-number/7JOLHEF6LSAXVJ3NUWJX4UAMYC/graph.json","events_json":"https://pith.science/api/pith-number/7JOLHEF6LSAXVJ3NUWJX4UAMYC/events.json","paper":"https://pith.science/paper/7JOLHEF6"},"agent_actions":{"view_html":"https://pith.science/pith/7JOLHEF6LSAXVJ3NUWJX4UAMYC","download_json":"https://pith.science/pith/7JOLHEF6LSAXVJ3NUWJX4UAMYC.json","view_paper":"https://pith.science/paper/7JOLHEF6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1809.07943&json=true","fetch_graph":"https://pith.science/api/pith-number/7JOLHEF6LSAXVJ3NUWJX4UAMYC/graph.json","fetch_events":"https://pith.science/api/pith-number/7JOLHEF6LSAXVJ3NUWJX4UAMYC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7JOLHEF6LSAXVJ3NUWJX4UAMYC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7JOLHEF6LSAXVJ3NUWJX4UAMYC/action/storage_attestation","attest_author":"https://pith.science/pith/7JOLHEF6LSAXVJ3NUWJX4UAMYC/action/author_attestation","sign_citation":"https://pith.science/pith/7JOLHEF6LSAXVJ3NUWJX4UAMYC/action/citation_signature","submit_replication":"https://pith.science/pith/7JOLHEF6LSAXVJ3NUWJX4UAMYC/action/replication_record"}},"created_at":"2026-07-05T00:00:12.869729+00:00","updated_at":"2026-07-05T00:00:12.869729+00:00"}