{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:GXPW4KRUPLG5TC5YB4FMMD6S3X","short_pith_number":"pith:GXPW4KRU","schema_version":"1.0","canonical_sha256":"35df6e2a347acdd98bb80f0ac60fd2ddf4b348fcbe4fc4e836320530a879e2e9","source":{"kind":"arxiv","id":"1007.1554","version":3},"attestation_state":"computed","paper":{"title":"The Direct Monodromy Problem of Painleve-I","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["hep-th","math-ph","math.MP","math.NA"],"primary_cat":"math.CA","authors_text":"Davide Masoero","submitted_at":"2010-07-09T10:37:36Z","abstract_excerpt":"The Painleve first equation can be represented as the equation of isomonodromic deformation of a Schrodinger equation with a cubic potential. We introduce a new algorithm for computing the direct monodromy problem for this Schrodinger equation. The algorithm is based on the geometric theory of Schrodinger equation due to Nevanlinna"},"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":"1007.1554","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CA","submitted_at":"2010-07-09T10:37:36Z","cross_cats_sorted":["hep-th","math-ph","math.MP","math.NA"],"title_canon_sha256":"07de5129f917c87df0a967fd95680670973d1e1905ba26e9ba3342d1bd5da227","abstract_canon_sha256":"3a084b90d9e3ccfdb1a047d716fd4334577bec78edb751c0570ec66e9ffa3a5a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:36:59.147453Z","signature_b64":"mN9TOlbuGQmmKkda7Ux7BvGBW9AkF7UkjaH3rmBCsKDd9sG7g1JwdLHVO/6rovvfcl5u5S8LbmC40qAFO9CnCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"35df6e2a347acdd98bb80f0ac60fd2ddf4b348fcbe4fc4e836320530a879e2e9","last_reissued_at":"2026-05-18T04:36:59.146961Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:36:59.146961Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Direct Monodromy Problem of Painleve-I","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["hep-th","math-ph","math.MP","math.NA"],"primary_cat":"math.CA","authors_text":"Davide Masoero","submitted_at":"2010-07-09T10:37:36Z","abstract_excerpt":"The Painleve first equation can be represented as the equation of isomonodromic deformation of a Schrodinger equation with a cubic potential. We introduce a new algorithm for computing the direct monodromy problem for this Schrodinger equation. The algorithm is based on the geometric theory of Schrodinger equation due to Nevanlinna"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1007.1554","kind":"arxiv","version":3},"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":"1007.1554","created_at":"2026-05-18T04:36:59.147043+00:00"},{"alias_kind":"arxiv_version","alias_value":"1007.1554v3","created_at":"2026-05-18T04:36:59.147043+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1007.1554","created_at":"2026-05-18T04:36:59.147043+00:00"},{"alias_kind":"pith_short_12","alias_value":"GXPW4KRUPLG5","created_at":"2026-05-18T12:26:07.630475+00:00"},{"alias_kind":"pith_short_16","alias_value":"GXPW4KRUPLG5TC5Y","created_at":"2026-05-18T12:26:07.630475+00:00"},{"alias_kind":"pith_short_8","alias_value":"GXPW4KRU","created_at":"2026-05-18T12:26:07.630475+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/GXPW4KRUPLG5TC5YB4FMMD6S3X","json":"https://pith.science/pith/GXPW4KRUPLG5TC5YB4FMMD6S3X.json","graph_json":"https://pith.science/api/pith-number/GXPW4KRUPLG5TC5YB4FMMD6S3X/graph.json","events_json":"https://pith.science/api/pith-number/GXPW4KRUPLG5TC5YB4FMMD6S3X/events.json","paper":"https://pith.science/paper/GXPW4KRU"},"agent_actions":{"view_html":"https://pith.science/pith/GXPW4KRUPLG5TC5YB4FMMD6S3X","download_json":"https://pith.science/pith/GXPW4KRUPLG5TC5YB4FMMD6S3X.json","view_paper":"https://pith.science/paper/GXPW4KRU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1007.1554&json=true","fetch_graph":"https://pith.science/api/pith-number/GXPW4KRUPLG5TC5YB4FMMD6S3X/graph.json","fetch_events":"https://pith.science/api/pith-number/GXPW4KRUPLG5TC5YB4FMMD6S3X/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GXPW4KRUPLG5TC5YB4FMMD6S3X/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GXPW4KRUPLG5TC5YB4FMMD6S3X/action/storage_attestation","attest_author":"https://pith.science/pith/GXPW4KRUPLG5TC5YB4FMMD6S3X/action/author_attestation","sign_citation":"https://pith.science/pith/GXPW4KRUPLG5TC5YB4FMMD6S3X/action/citation_signature","submit_replication":"https://pith.science/pith/GXPW4KRUPLG5TC5YB4FMMD6S3X/action/replication_record"}},"created_at":"2026-05-18T04:36:59.147043+00:00","updated_at":"2026-05-18T04:36:59.147043+00:00"}