{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:UPR2BLRQEVY5RFWTZXZA5JSSXW","short_pith_number":"pith:UPR2BLRQ","schema_version":"1.0","canonical_sha256":"a3e3a0ae302571d896d3cdf20ea652bdb986565e78244df07887bb893356b4d6","source":{"kind":"arxiv","id":"1103.1759","version":4},"attestation_state":"computed","paper":{"title":"Every graph is a cut locus","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.DG","authors_text":"Costin V\\^ilcu, Jin-ichi Itoh","submitted_at":"2011-03-09T11:36:01Z","abstract_excerpt":"We prove that every connected graph can be realized as the cut locus of some point on some Riemannian surface $S$ which, in some cases, has constant curvature. We study the stability of such realizations, and their generic behavior."},"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":"1103.1759","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.DG","submitted_at":"2011-03-09T11:36:01Z","cross_cats_sorted":[],"title_canon_sha256":"5cb4a8b9cf5dbefcbc251a56c5183c3f79ff5aac09d970e8561f62ab02422327","abstract_canon_sha256":"6ac7973ab38a2e1bc8b53af73695a39c8389e241cf818a5f963fb9a5833d0312"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:09:25.669785Z","signature_b64":"XCk72wTekmUVrrobyDyJRYMcHWpm6Rk+44IHb3Y7AG5CGGlsAtybF8XqNw0GFwXI8JQIQ4t+aXS/lQ782m38DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a3e3a0ae302571d896d3cdf20ea652bdb986565e78244df07887bb893356b4d6","last_reissued_at":"2026-05-18T01:09:25.669195Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:09:25.669195Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Every graph is a cut locus","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.DG","authors_text":"Costin V\\^ilcu, Jin-ichi Itoh","submitted_at":"2011-03-09T11:36:01Z","abstract_excerpt":"We prove that every connected graph can be realized as the cut locus of some point on some Riemannian surface $S$ which, in some cases, has constant curvature. We study the stability of such realizations, and their generic behavior."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1103.1759","kind":"arxiv","version":4},"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":"1103.1759","created_at":"2026-05-18T01:09:25.669267+00:00"},{"alias_kind":"arxiv_version","alias_value":"1103.1759v4","created_at":"2026-05-18T01:09:25.669267+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.1759","created_at":"2026-05-18T01:09:25.669267+00:00"},{"alias_kind":"pith_short_12","alias_value":"UPR2BLRQEVY5","created_at":"2026-05-18T12:26:42.757692+00:00"},{"alias_kind":"pith_short_16","alias_value":"UPR2BLRQEVY5RFWT","created_at":"2026-05-18T12:26:42.757692+00:00"},{"alias_kind":"pith_short_8","alias_value":"UPR2BLRQ","created_at":"2026-05-18T12:26:42.757692+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/UPR2BLRQEVY5RFWTZXZA5JSSXW","json":"https://pith.science/pith/UPR2BLRQEVY5RFWTZXZA5JSSXW.json","graph_json":"https://pith.science/api/pith-number/UPR2BLRQEVY5RFWTZXZA5JSSXW/graph.json","events_json":"https://pith.science/api/pith-number/UPR2BLRQEVY5RFWTZXZA5JSSXW/events.json","paper":"https://pith.science/paper/UPR2BLRQ"},"agent_actions":{"view_html":"https://pith.science/pith/UPR2BLRQEVY5RFWTZXZA5JSSXW","download_json":"https://pith.science/pith/UPR2BLRQEVY5RFWTZXZA5JSSXW.json","view_paper":"https://pith.science/paper/UPR2BLRQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1103.1759&json=true","fetch_graph":"https://pith.science/api/pith-number/UPR2BLRQEVY5RFWTZXZA5JSSXW/graph.json","fetch_events":"https://pith.science/api/pith-number/UPR2BLRQEVY5RFWTZXZA5JSSXW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UPR2BLRQEVY5RFWTZXZA5JSSXW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UPR2BLRQEVY5RFWTZXZA5JSSXW/action/storage_attestation","attest_author":"https://pith.science/pith/UPR2BLRQEVY5RFWTZXZA5JSSXW/action/author_attestation","sign_citation":"https://pith.science/pith/UPR2BLRQEVY5RFWTZXZA5JSSXW/action/citation_signature","submit_replication":"https://pith.science/pith/UPR2BLRQEVY5RFWTZXZA5JSSXW/action/replication_record"}},"created_at":"2026-05-18T01:09:25.669267+00:00","updated_at":"2026-05-18T01:09:25.669267+00:00"}