{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2009:GOVXCNYKM3RZK4CMCCR24IJM2U","short_pith_number":"pith:GOVXCNYK","schema_version":"1.0","canonical_sha256":"33ab71370a66e395704c10a3ae212cd50a601c32acd02bbd40e7048031d632bf","source":{"kind":"arxiv","id":"0905.4759","version":3},"attestation_state":"computed","paper":{"title":"Boundary Nevanlinna-Pick interpolation via reduction and augmentation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CV","authors_text":"Jim Agler, N. J. Young","submitted_at":"2009-05-28T22:13:06Z","abstract_excerpt":"We give an elementary proof of Sarason's solvability criterion for the Nevanlinna-Pick problem with boundary interpolation nodes and boundary target values. We also give a concrete parametrization of all solutions of such a problem. The proofs are based on a reduction method due to Julia and Nevanlinna. Reduction of functions corresponds to Schur complementation of the corresponding Pick matrices."},"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":"0905.4759","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CV","submitted_at":"2009-05-28T22:13:06Z","cross_cats_sorted":[],"title_canon_sha256":"86fc81e15b6311a3960e3580a9077ab8971352ced1409443830e82ef57fa1de5","abstract_canon_sha256":"5507b017ab58eab1ffb018e456e3393efc14d6f6a6a0141af37e90a91d01de30"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:36:50.413775Z","signature_b64":"Y1xWZTdP1rdJbo22b1ZDxzp86a6i0FtcnNZiJ2rnbB4vr7cY+B+ErbefvBVBJWfjwvFV25XyRbBek81C2XKvDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"33ab71370a66e395704c10a3ae212cd50a601c32acd02bbd40e7048031d632bf","last_reissued_at":"2026-05-18T04:36:50.413088Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:36:50.413088Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Boundary Nevanlinna-Pick interpolation via reduction and augmentation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CV","authors_text":"Jim Agler, N. J. Young","submitted_at":"2009-05-28T22:13:06Z","abstract_excerpt":"We give an elementary proof of Sarason's solvability criterion for the Nevanlinna-Pick problem with boundary interpolation nodes and boundary target values. We also give a concrete parametrization of all solutions of such a problem. The proofs are based on a reduction method due to Julia and Nevanlinna. Reduction of functions corresponds to Schur complementation of the corresponding Pick matrices."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0905.4759","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":"0905.4759","created_at":"2026-05-18T04:36:50.413191+00:00"},{"alias_kind":"arxiv_version","alias_value":"0905.4759v3","created_at":"2026-05-18T04:36:50.413191+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0905.4759","created_at":"2026-05-18T04:36:50.413191+00:00"},{"alias_kind":"pith_short_12","alias_value":"GOVXCNYKM3RZ","created_at":"2026-05-18T12:25:59.703012+00:00"},{"alias_kind":"pith_short_16","alias_value":"GOVXCNYKM3RZK4CM","created_at":"2026-05-18T12:25:59.703012+00:00"},{"alias_kind":"pith_short_8","alias_value":"GOVXCNYK","created_at":"2026-05-18T12:25:59.703012+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/GOVXCNYKM3RZK4CMCCR24IJM2U","json":"https://pith.science/pith/GOVXCNYKM3RZK4CMCCR24IJM2U.json","graph_json":"https://pith.science/api/pith-number/GOVXCNYKM3RZK4CMCCR24IJM2U/graph.json","events_json":"https://pith.science/api/pith-number/GOVXCNYKM3RZK4CMCCR24IJM2U/events.json","paper":"https://pith.science/paper/GOVXCNYK"},"agent_actions":{"view_html":"https://pith.science/pith/GOVXCNYKM3RZK4CMCCR24IJM2U","download_json":"https://pith.science/pith/GOVXCNYKM3RZK4CMCCR24IJM2U.json","view_paper":"https://pith.science/paper/GOVXCNYK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0905.4759&json=true","fetch_graph":"https://pith.science/api/pith-number/GOVXCNYKM3RZK4CMCCR24IJM2U/graph.json","fetch_events":"https://pith.science/api/pith-number/GOVXCNYKM3RZK4CMCCR24IJM2U/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GOVXCNYKM3RZK4CMCCR24IJM2U/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GOVXCNYKM3RZK4CMCCR24IJM2U/action/storage_attestation","attest_author":"https://pith.science/pith/GOVXCNYKM3RZK4CMCCR24IJM2U/action/author_attestation","sign_citation":"https://pith.science/pith/GOVXCNYKM3RZK4CMCCR24IJM2U/action/citation_signature","submit_replication":"https://pith.science/pith/GOVXCNYKM3RZK4CMCCR24IJM2U/action/replication_record"}},"created_at":"2026-05-18T04:36:50.413191+00:00","updated_at":"2026-05-18T04:36:50.413191+00:00"}