{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:FJ2GKZ3ENLSOCYYW3MAKPMF367","short_pith_number":"pith:FJ2GKZ3E","canonical_record":{"source":{"id":"1306.5729","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-06-24T19:55:42Z","cross_cats_sorted":[],"title_canon_sha256":"a24128e1196af4fae025e1a0b5095962414d3f7fd2adc927e9b955a1af188071","abstract_canon_sha256":"b3cc86997a66c5f5e4d257932d16093b191fb7a95f59f82e3947c80cd332dab7"},"schema_version":"1.0"},"canonical_sha256":"2a746567646ae4e16316db00a7b0bbf7fa0c6a78769a148ff5da478803676037","source":{"kind":"arxiv","id":"1306.5729","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1306.5729","created_at":"2026-05-18T03:20:07Z"},{"alias_kind":"arxiv_version","alias_value":"1306.5729v1","created_at":"2026-05-18T03:20:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.5729","created_at":"2026-05-18T03:20:07Z"},{"alias_kind":"pith_short_12","alias_value":"FJ2GKZ3ENLSO","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_16","alias_value":"FJ2GKZ3ENLSOCYYW","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_8","alias_value":"FJ2GKZ3E","created_at":"2026-05-18T12:27:45Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:FJ2GKZ3ENLSOCYYW3MAKPMF367","target":"record","payload":{"canonical_record":{"source":{"id":"1306.5729","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-06-24T19:55:42Z","cross_cats_sorted":[],"title_canon_sha256":"a24128e1196af4fae025e1a0b5095962414d3f7fd2adc927e9b955a1af188071","abstract_canon_sha256":"b3cc86997a66c5f5e4d257932d16093b191fb7a95f59f82e3947c80cd332dab7"},"schema_version":"1.0"},"canonical_sha256":"2a746567646ae4e16316db00a7b0bbf7fa0c6a78769a148ff5da478803676037","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:20:07.143951Z","signature_b64":"tgKiPs8E64mev//LOAPP58nrbRtRZrGc2Tklp3ANl3eW4HzskapILVyQAPaVpH9QCq9ScKOxxACRa/TQ6c3iDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2a746567646ae4e16316db00a7b0bbf7fa0c6a78769a148ff5da478803676037","last_reissued_at":"2026-05-18T03:20:07.143374Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:20:07.143374Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1306.5729","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:20:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zuDxCsNYdim21fOnWXGaf9vV7ckwzbmTzQSdvfhD5DbXWjOeb83WKYJDJ5cjI801/Iexs3S4T8L9csqqTSYNBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T14:54:22.095494Z"},"content_sha256":"ab970d73148a842fdd61ee3cc378095a85976897c99c737e04c7fb7034e6096a","schema_version":"1.0","event_id":"sha256:ab970d73148a842fdd61ee3cc378095a85976897c99c737e04c7fb7034e6096a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:FJ2GKZ3ENLSOCYYW3MAKPMF367","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Computation of sparse low degree interpolating polynomials and their application to derivative-free optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Afonso S. Bandeira, Katya Scheinberg, Luis Nunes Vicente","submitted_at":"2013-06-24T19:55:42Z","abstract_excerpt":"Interpolation-based trust-region methods are an important class of algorithms for Derivative-Free Optimization which rely on locally approximating an objective function by quadratic polynomial interpolation models, frequently built from less points than there are basis components. Often, in practical applications, the contribution of the problem variables to the objective function is such that many pairwise correlations between variables are negligible, implying, in the smooth case, a sparse structure in the Hessian matrix. To be able to exploit Hessian sparsity, existing optimization approach"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.5729","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":""},"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:20:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bE4HPqMZMyXevYj1YAJ9IQ96I7MTuTAEyg2OOIZl3nDGV1A8IPq4Ihx2wMT2ldSOu8qTf+yefF8LJKV89i/eDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T14:54:22.096004Z"},"content_sha256":"c7e067e173848abcbe4e7eaafa99b9b436f91ea94af35196abf40ec1ab737071","schema_version":"1.0","event_id":"sha256:c7e067e173848abcbe4e7eaafa99b9b436f91ea94af35196abf40ec1ab737071"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FJ2GKZ3ENLSOCYYW3MAKPMF367/bundle.json","state_url":"https://pith.science/pith/FJ2GKZ3ENLSOCYYW3MAKPMF367/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FJ2GKZ3ENLSOCYYW3MAKPMF367/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-28T14:54:22Z","links":{"resolver":"https://pith.science/pith/FJ2GKZ3ENLSOCYYW3MAKPMF367","bundle":"https://pith.science/pith/FJ2GKZ3ENLSOCYYW3MAKPMF367/bundle.json","state":"https://pith.science/pith/FJ2GKZ3ENLSOCYYW3MAKPMF367/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FJ2GKZ3ENLSOCYYW3MAKPMF367/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:FJ2GKZ3ENLSOCYYW3MAKPMF367","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"b3cc86997a66c5f5e4d257932d16093b191fb7a95f59f82e3947c80cd332dab7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-06-24T19:55:42Z","title_canon_sha256":"a24128e1196af4fae025e1a0b5095962414d3f7fd2adc927e9b955a1af188071"},"schema_version":"1.0","source":{"id":"1306.5729","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1306.5729","created_at":"2026-05-18T03:20:07Z"},{"alias_kind":"arxiv_version","alias_value":"1306.5729v1","created_at":"2026-05-18T03:20:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.5729","created_at":"2026-05-18T03:20:07Z"},{"alias_kind":"pith_short_12","alias_value":"FJ2GKZ3ENLSO","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_16","alias_value":"FJ2GKZ3ENLSOCYYW","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_8","alias_value":"FJ2GKZ3E","created_at":"2026-05-18T12:27:45Z"}],"graph_snapshots":[{"event_id":"sha256:c7e067e173848abcbe4e7eaafa99b9b436f91ea94af35196abf40ec1ab737071","target":"graph","created_at":"2026-05-18T03:20:07Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"Interpolation-based trust-region methods are an important class of algorithms for Derivative-Free Optimization which rely on locally approximating an objective function by quadratic polynomial interpolation models, frequently built from less points than there are basis components. Often, in practical applications, the contribution of the problem variables to the objective function is such that many pairwise correlations between variables are negligible, implying, in the smooth case, a sparse structure in the Hessian matrix. To be able to exploit Hessian sparsity, existing optimization approach","authors_text":"Afonso S. Bandeira, Katya Scheinberg, Luis Nunes Vicente","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-06-24T19:55:42Z","title":"Computation of sparse low degree interpolating polynomials and their application to derivative-free optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.5729","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:ab970d73148a842fdd61ee3cc378095a85976897c99c737e04c7fb7034e6096a","target":"record","created_at":"2026-05-18T03:20:07Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"b3cc86997a66c5f5e4d257932d16093b191fb7a95f59f82e3947c80cd332dab7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-06-24T19:55:42Z","title_canon_sha256":"a24128e1196af4fae025e1a0b5095962414d3f7fd2adc927e9b955a1af188071"},"schema_version":"1.0","source":{"id":"1306.5729","kind":"arxiv","version":1}},"canonical_sha256":"2a746567646ae4e16316db00a7b0bbf7fa0c6a78769a148ff5da478803676037","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2a746567646ae4e16316db00a7b0bbf7fa0c6a78769a148ff5da478803676037","first_computed_at":"2026-05-18T03:20:07.143374Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:20:07.143374Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tgKiPs8E64mev//LOAPP58nrbRtRZrGc2Tklp3ANl3eW4HzskapILVyQAPaVpH9QCq9ScKOxxACRa/TQ6c3iDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:20:07.143951Z","signed_message":"canonical_sha256_bytes"},"source_id":"1306.5729","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ab970d73148a842fdd61ee3cc378095a85976897c99c737e04c7fb7034e6096a","sha256:c7e067e173848abcbe4e7eaafa99b9b436f91ea94af35196abf40ec1ab737071"],"state_sha256":"f9c0a6217571b411a3fcfb621c27f655d508e5953ab5fc054b7cca752419bfc8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PuUT/ngmSuSurmST1ypzdlKRCxfQzeod9iWeGP1L2TPViRV5j57uHmf2exN5kOCpsO8mLqU69dOGJqYfs6PrBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T14:54:22.098850Z","bundle_sha256":"906bd3e5a35b4d3a034c2f931f0b875764832d6fca57182ffb95241772b4b947"}}