{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:ZU524GGUKDRVLGUAGLUC2YG53G","short_pith_number":"pith:ZU524GGU","schema_version":"1.0","canonical_sha256":"cd3bae18d450e3559a8032e82d60ddd98f45bbcdf39d7a21ff7f8319ab35ae04","source":{"kind":"arxiv","id":"1110.4560","version":3},"attestation_state":"computed","paper":{"title":"A unified approach to computation of integrable structures","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math-ph","math.DG","math.MP"],"primary_cat":"nlin.SI","authors_text":"Alexander Verbovetsky, Iosif Krasil'shchik, Raffaele Vitolo","submitted_at":"2011-10-20T15:59:49Z","abstract_excerpt":"We expose (without proofs) a unified computational approach to integrable structures (including recursion, Hamiltonian, and symplectic operators) based on geometrical theory of partial differential equations. We adopt a coordinate based approach and aim to provide a tutorial to the computations."},"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":"1110.4560","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"nlin.SI","submitted_at":"2011-10-20T15:59:49Z","cross_cats_sorted":["math-ph","math.DG","math.MP"],"title_canon_sha256":"78c552ce3535d07900f224d93a610c870b20ddf69f02600412967e6e6480a951","abstract_canon_sha256":"0fa2eb18e05c93545ac7c3926956ad3a3fed87990c8eb818566b817a0c68f17c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:51:02.262613Z","signature_b64":"5r/4IoOSfR3GsI+sWJslLKcbXCJ1+pmtaWGNI/f2gE5ZnUodKHWunxZCo7DkAn2i6vyJSeJCpRtjh2nYHgJ7DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cd3bae18d450e3559a8032e82d60ddd98f45bbcdf39d7a21ff7f8319ab35ae04","last_reissued_at":"2026-05-18T03:51:02.261884Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:51:02.261884Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A unified approach to computation of integrable structures","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math-ph","math.DG","math.MP"],"primary_cat":"nlin.SI","authors_text":"Alexander Verbovetsky, Iosif Krasil'shchik, Raffaele Vitolo","submitted_at":"2011-10-20T15:59:49Z","abstract_excerpt":"We expose (without proofs) a unified computational approach to integrable structures (including recursion, Hamiltonian, and symplectic operators) based on geometrical theory of partial differential equations. We adopt a coordinate based approach and aim to provide a tutorial to the computations."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1110.4560","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":"1110.4560","created_at":"2026-05-18T03:51:02.261999+00:00"},{"alias_kind":"arxiv_version","alias_value":"1110.4560v3","created_at":"2026-05-18T03:51:02.261999+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1110.4560","created_at":"2026-05-18T03:51:02.261999+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZU524GGUKDRV","created_at":"2026-05-18T12:26:50.516681+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZU524GGUKDRVLGUA","created_at":"2026-05-18T12:26:50.516681+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZU524GGU","created_at":"2026-05-18T12:26:50.516681+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/ZU524GGUKDRVLGUAGLUC2YG53G","json":"https://pith.science/pith/ZU524GGUKDRVLGUAGLUC2YG53G.json","graph_json":"https://pith.science/api/pith-number/ZU524GGUKDRVLGUAGLUC2YG53G/graph.json","events_json":"https://pith.science/api/pith-number/ZU524GGUKDRVLGUAGLUC2YG53G/events.json","paper":"https://pith.science/paper/ZU524GGU"},"agent_actions":{"view_html":"https://pith.science/pith/ZU524GGUKDRVLGUAGLUC2YG53G","download_json":"https://pith.science/pith/ZU524GGUKDRVLGUAGLUC2YG53G.json","view_paper":"https://pith.science/paper/ZU524GGU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1110.4560&json=true","fetch_graph":"https://pith.science/api/pith-number/ZU524GGUKDRVLGUAGLUC2YG53G/graph.json","fetch_events":"https://pith.science/api/pith-number/ZU524GGUKDRVLGUAGLUC2YG53G/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZU524GGUKDRVLGUAGLUC2YG53G/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZU524GGUKDRVLGUAGLUC2YG53G/action/storage_attestation","attest_author":"https://pith.science/pith/ZU524GGUKDRVLGUAGLUC2YG53G/action/author_attestation","sign_citation":"https://pith.science/pith/ZU524GGUKDRVLGUAGLUC2YG53G/action/citation_signature","submit_replication":"https://pith.science/pith/ZU524GGUKDRVLGUAGLUC2YG53G/action/replication_record"}},"created_at":"2026-05-18T03:51:02.261999+00:00","updated_at":"2026-05-18T03:51:02.261999+00:00"}