{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:NDGVUCIUACMSHJ4EATCL3ZRQNF","short_pith_number":"pith:NDGVUCIU","canonical_record":{"source":{"id":"1408.4036","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-08-18T15:20:09Z","cross_cats_sorted":["cs.CG","cs.DM","math.MG"],"title_canon_sha256":"71f51363c89ef91af89210f304f04f0a218b874594e7a6e66be609c4f786b21c","abstract_canon_sha256":"8784d293d6e17646c69445cb1c83aff407002a71613413f98600620a1f84d68d"},"schema_version":"1.0"},"canonical_sha256":"68cd5a0914009923a78404c4bde6306950a87609a260e3e6d351855a7acf4dc3","source":{"kind":"arxiv","id":"1408.4036","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.4036","created_at":"2026-05-18T02:19:28Z"},{"alias_kind":"arxiv_version","alias_value":"1408.4036v2","created_at":"2026-05-18T02:19:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.4036","created_at":"2026-05-18T02:19:28Z"},{"alias_kind":"pith_short_12","alias_value":"NDGVUCIUACMS","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_16","alias_value":"NDGVUCIUACMSHJ4E","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_8","alias_value":"NDGVUCIU","created_at":"2026-05-18T12:28:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:NDGVUCIUACMSHJ4EATCL3ZRQNF","target":"record","payload":{"canonical_record":{"source":{"id":"1408.4036","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-08-18T15:20:09Z","cross_cats_sorted":["cs.CG","cs.DM","math.MG"],"title_canon_sha256":"71f51363c89ef91af89210f304f04f0a218b874594e7a6e66be609c4f786b21c","abstract_canon_sha256":"8784d293d6e17646c69445cb1c83aff407002a71613413f98600620a1f84d68d"},"schema_version":"1.0"},"canonical_sha256":"68cd5a0914009923a78404c4bde6306950a87609a260e3e6d351855a7acf4dc3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:19:28.409431Z","signature_b64":"MiDpX6o92jfNHM3aUT/N4NfMTK3rUYnx9XNon/2DRs34gH6SUAQ84IMwlEkmnT25afOofLMi+aRnUGGlJGNLAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"68cd5a0914009923a78404c4bde6306950a87609a260e3e6d351855a7acf4dc3","last_reissued_at":"2026-05-18T02:19:28.408941Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:19:28.408941Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1408.4036","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-18T02:19:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"T+Xk24ZhCdDtZdhpm9rhc4jUxpcGEXbLHipszki/DGf8NQQwpInXthIdmF0bbZxABMx0YSTTkGBi5Be5n8VhCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T03:01:36.340037Z"},"content_sha256":"58bd940e929312517dc9b4ba559d5d14ec1a30f2c851a3ac00b7736622a5281d","schema_version":"1.0","event_id":"sha256:58bd940e929312517dc9b4ba559d5d14ec1a30f2c851a3ac00b7736622a5281d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:NDGVUCIUACMSHJ4EATCL3ZRQNF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Discrete Systolic Inequalities and Decompositions of Triangulated Surfaces","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG","cs.DM","math.MG"],"primary_cat":"math.CO","authors_text":"Alfredo Hubard, Arnaud de Mesmay, \\'Eric Colin de Verdi\\`ere","submitted_at":"2014-08-18T15:20:09Z","abstract_excerpt":"How much cutting is needed to simplify the topology of a surface? We provide bounds for several instances of this question, for the minimum length of topologically non-trivial closed curves, pants decompositions, and cut graphs with a given combinatorial map in triangulated combinatorial surfaces (or their dual cross-metric counterpart).\n  Our work builds upon Riemannian systolic inequalities, which bound the minimum length of non-trivial closed curves in terms of the genus and the area of the surface. We first describe a systematic way to translate Riemannian systolic inequalities to a discre"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.4036","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-18T02:19:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yKUHaxYus7Wy48PFVnBykDgmbVlz8L7y/h6Y3/9isO9voyn9P2g5vY5FSCXDkRCRxcNINXTcJc9ksQPJ3er2DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T03:01:36.340402Z"},"content_sha256":"2016bc96469881dc1f78ff23f030ee21995c2e74d590b3d4c067dda6d689b3a6","schema_version":"1.0","event_id":"sha256:2016bc96469881dc1f78ff23f030ee21995c2e74d590b3d4c067dda6d689b3a6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NDGVUCIUACMSHJ4EATCL3ZRQNF/bundle.json","state_url":"https://pith.science/pith/NDGVUCIUACMSHJ4EATCL3ZRQNF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NDGVUCIUACMSHJ4EATCL3ZRQNF/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-20T03:01:36Z","links":{"resolver":"https://pith.science/pith/NDGVUCIUACMSHJ4EATCL3ZRQNF","bundle":"https://pith.science/pith/NDGVUCIUACMSHJ4EATCL3ZRQNF/bundle.json","state":"https://pith.science/pith/NDGVUCIUACMSHJ4EATCL3ZRQNF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NDGVUCIUACMSHJ4EATCL3ZRQNF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:NDGVUCIUACMSHJ4EATCL3ZRQNF","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":"8784d293d6e17646c69445cb1c83aff407002a71613413f98600620a1f84d68d","cross_cats_sorted":["cs.CG","cs.DM","math.MG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-08-18T15:20:09Z","title_canon_sha256":"71f51363c89ef91af89210f304f04f0a218b874594e7a6e66be609c4f786b21c"},"schema_version":"1.0","source":{"id":"1408.4036","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.4036","created_at":"2026-05-18T02:19:28Z"},{"alias_kind":"arxiv_version","alias_value":"1408.4036v2","created_at":"2026-05-18T02:19:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.4036","created_at":"2026-05-18T02:19:28Z"},{"alias_kind":"pith_short_12","alias_value":"NDGVUCIUACMS","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_16","alias_value":"NDGVUCIUACMSHJ4E","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_8","alias_value":"NDGVUCIU","created_at":"2026-05-18T12:28:41Z"}],"graph_snapshots":[{"event_id":"sha256:2016bc96469881dc1f78ff23f030ee21995c2e74d590b3d4c067dda6d689b3a6","target":"graph","created_at":"2026-05-18T02:19:28Z","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":"How much cutting is needed to simplify the topology of a surface? We provide bounds for several instances of this question, for the minimum length of topologically non-trivial closed curves, pants decompositions, and cut graphs with a given combinatorial map in triangulated combinatorial surfaces (or their dual cross-metric counterpart).\n  Our work builds upon Riemannian systolic inequalities, which bound the minimum length of non-trivial closed curves in terms of the genus and the area of the surface. We first describe a systematic way to translate Riemannian systolic inequalities to a discre","authors_text":"Alfredo Hubard, Arnaud de Mesmay, \\'Eric Colin de Verdi\\`ere","cross_cats":["cs.CG","cs.DM","math.MG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-08-18T15:20:09Z","title":"Discrete Systolic Inequalities and Decompositions of Triangulated Surfaces"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.4036","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:58bd940e929312517dc9b4ba559d5d14ec1a30f2c851a3ac00b7736622a5281d","target":"record","created_at":"2026-05-18T02:19:28Z","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":"8784d293d6e17646c69445cb1c83aff407002a71613413f98600620a1f84d68d","cross_cats_sorted":["cs.CG","cs.DM","math.MG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-08-18T15:20:09Z","title_canon_sha256":"71f51363c89ef91af89210f304f04f0a218b874594e7a6e66be609c4f786b21c"},"schema_version":"1.0","source":{"id":"1408.4036","kind":"arxiv","version":2}},"canonical_sha256":"68cd5a0914009923a78404c4bde6306950a87609a260e3e6d351855a7acf4dc3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"68cd5a0914009923a78404c4bde6306950a87609a260e3e6d351855a7acf4dc3","first_computed_at":"2026-05-18T02:19:28.408941Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:19:28.408941Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"MiDpX6o92jfNHM3aUT/N4NfMTK3rUYnx9XNon/2DRs34gH6SUAQ84IMwlEkmnT25afOofLMi+aRnUGGlJGNLAg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:19:28.409431Z","signed_message":"canonical_sha256_bytes"},"source_id":"1408.4036","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:58bd940e929312517dc9b4ba559d5d14ec1a30f2c851a3ac00b7736622a5281d","sha256:2016bc96469881dc1f78ff23f030ee21995c2e74d590b3d4c067dda6d689b3a6"],"state_sha256":"cb0f7b44f6a78d588e48bda2cc628bbbfd7972ea3b9ebee5736ca385fb7b8b62"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zF+IZOPWMhmZ4XmBy2SVLrwIh/biOz+sM0k0gZFzJJAN8mTNbHNe78tzLtgc05e2qvBNuog6MTRoYKZJo+oZDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T03:01:36.342286Z","bundle_sha256":"d2a5a790f474a81e29aa8e9a06c8857046433c66ddb9184fd9d735e672ec7752"}}