{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:QC3VABGLIB4UXLXTY5WQJWJEDG","short_pith_number":"pith:QC3VABGL","schema_version":"1.0","canonical_sha256":"80b75004cb40794baef3c76d04d92419b6d0854f0d8ca34e5e974d22224ba979","source":{"kind":"arxiv","id":"2606.13564","version":1},"attestation_state":"computed","paper":{"title":"Nash's theorem via G\\\"unther's trick","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":["math.AP"],"primary_cat":"math.DG","authors_text":"Anton Petrunin","submitted_at":"2026-06-11T16:48:41Z","abstract_excerpt":"We present a proof of Nash's smooth embedding theorem with an emphasis on accessibility and rigor."},"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":"2606.13564","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"math.DG","submitted_at":"2026-06-11T16:48:41Z","cross_cats_sorted":["math.AP"],"title_canon_sha256":"b4c03a435f2f52a758ae3e4d8b9fd74c48307bade5d3dd5a2d988e70d20f69b6","abstract_canon_sha256":"0320ded153e3da9ac606fe4e8e6298f0360adacc14259c7f513f259b16b52753"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-12T01:10:10.410185Z","signature_b64":"nCnklPj1P6ArM75qX/ncexbxg4e91ssqpEdOY0kKGgK1R4nXnQ0RdM31fETcoO58dMLrygN0CmJZxPNdOKB7BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"80b75004cb40794baef3c76d04d92419b6d0854f0d8ca34e5e974d22224ba979","last_reissued_at":"2026-06-12T01:10:10.409407Z","signature_status":"signed_v1","first_computed_at":"2026-06-12T01:10:10.409407Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Nash's theorem via G\\\"unther's trick","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":["math.AP"],"primary_cat":"math.DG","authors_text":"Anton Petrunin","submitted_at":"2026-06-11T16:48:41Z","abstract_excerpt":"We present a proof of Nash's smooth embedding theorem with an emphasis on accessibility and rigor."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.13564","kind":"arxiv","version":1},"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/2606.13564/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":"2606.13564","created_at":"2026-06-12T01:10:10.409530+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.13564v1","created_at":"2026-06-12T01:10:10.409530+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.13564","created_at":"2026-06-12T01:10:10.409530+00:00"},{"alias_kind":"pith_short_12","alias_value":"QC3VABGLIB4U","created_at":"2026-06-12T01:10:10.409530+00:00"},{"alias_kind":"pith_short_16","alias_value":"QC3VABGLIB4UXLXT","created_at":"2026-06-12T01:10:10.409530+00:00"},{"alias_kind":"pith_short_8","alias_value":"QC3VABGL","created_at":"2026-06-12T01:10:10.409530+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/QC3VABGLIB4UXLXTY5WQJWJEDG","json":"https://pith.science/pith/QC3VABGLIB4UXLXTY5WQJWJEDG.json","graph_json":"https://pith.science/api/pith-number/QC3VABGLIB4UXLXTY5WQJWJEDG/graph.json","events_json":"https://pith.science/api/pith-number/QC3VABGLIB4UXLXTY5WQJWJEDG/events.json","paper":"https://pith.science/paper/QC3VABGL"},"agent_actions":{"view_html":"https://pith.science/pith/QC3VABGLIB4UXLXTY5WQJWJEDG","download_json":"https://pith.science/pith/QC3VABGLIB4UXLXTY5WQJWJEDG.json","view_paper":"https://pith.science/paper/QC3VABGL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.13564&json=true","fetch_graph":"https://pith.science/api/pith-number/QC3VABGLIB4UXLXTY5WQJWJEDG/graph.json","fetch_events":"https://pith.science/api/pith-number/QC3VABGLIB4UXLXTY5WQJWJEDG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QC3VABGLIB4UXLXTY5WQJWJEDG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QC3VABGLIB4UXLXTY5WQJWJEDG/action/storage_attestation","attest_author":"https://pith.science/pith/QC3VABGLIB4UXLXTY5WQJWJEDG/action/author_attestation","sign_citation":"https://pith.science/pith/QC3VABGLIB4UXLXTY5WQJWJEDG/action/citation_signature","submit_replication":"https://pith.science/pith/QC3VABGLIB4UXLXTY5WQJWJEDG/action/replication_record"}},"created_at":"2026-06-12T01:10:10.409530+00:00","updated_at":"2026-06-12T01:10:10.409530+00:00"}