{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:BZCAIZJ4SDB5PU6GJ5V3WTOXFT","short_pith_number":"pith:BZCAIZJ4","canonical_record":{"source":{"id":"1607.08498","kind":"arxiv","version":6},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-07-28T15:16:27Z","cross_cats_sorted":[],"title_canon_sha256":"f1a2865fc129e15633336e10a2994dd0121c615692184fe557b6451ed51c1fdf","abstract_canon_sha256":"cdf5511f9c5169f947374bb8bc7e585df838318fe106c42b70428a108917343a"},"schema_version":"1.0"},"canonical_sha256":"0e4404653c90c3d7d3c64f6bbb4dd72ce4c51f833c88a265782e82bc782507cf","source":{"kind":"arxiv","id":"1607.08498","version":6},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.08498","created_at":"2026-05-18T01:00:05Z"},{"alias_kind":"arxiv_version","alias_value":"1607.08498v6","created_at":"2026-05-18T01:00:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.08498","created_at":"2026-05-18T01:00:05Z"},{"alias_kind":"pith_short_12","alias_value":"BZCAIZJ4SDB5","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_16","alias_value":"BZCAIZJ4SDB5PU6G","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_8","alias_value":"BZCAIZJ4","created_at":"2026-05-18T12:30:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:BZCAIZJ4SDB5PU6GJ5V3WTOXFT","target":"record","payload":{"canonical_record":{"source":{"id":"1607.08498","kind":"arxiv","version":6},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-07-28T15:16:27Z","cross_cats_sorted":[],"title_canon_sha256":"f1a2865fc129e15633336e10a2994dd0121c615692184fe557b6451ed51c1fdf","abstract_canon_sha256":"cdf5511f9c5169f947374bb8bc7e585df838318fe106c42b70428a108917343a"},"schema_version":"1.0"},"canonical_sha256":"0e4404653c90c3d7d3c64f6bbb4dd72ce4c51f833c88a265782e82bc782507cf","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:00:05.551044Z","signature_b64":"MKq7XF6ABQtSMPuqWdRcAmAzJxQQT0YAnRB9pVwC4G38m0lnqWqemGKcU0I1NeADh8eq8ClJh6f8EgmckIPfDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0e4404653c90c3d7d3c64f6bbb4dd72ce4c51f833c88a265782e82bc782507cf","last_reissued_at":"2026-05-18T01:00:05.550417Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:00:05.550417Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1607.08498","source_version":6,"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-18T01:00:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"g1T1n4iNdc5bghr8lyuAczI/JOenAbXULcaIgbVzD5Q3sRLcyB9DQyvdW5qcP1P9hSi7cQwISsLI0AotFesMDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T18:26:27.652168Z"},"content_sha256":"92df4e44439aa105965962ca824508c9e390cea9de50d531ed0a2183e1eb0aeb","schema_version":"1.0","event_id":"sha256:92df4e44439aa105965962ca824508c9e390cea9de50d531ed0a2183e1eb0aeb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:BZCAIZJ4SDB5PU6GJ5V3WTOXFT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Two-Stage Active-Set Algorithm for Bound-Constrained Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Andrea Cristofari, Francesco Rinaldi, Marianna De Santis, Stefano Lucidi","submitted_at":"2016-07-28T15:16:27Z","abstract_excerpt":"In this paper, we describe a two-stage method for solving optimization problems with bound constraints. It combines the active-set estimate described in [Facchinei and Lucidi, 1995] with a modification of the non-monotone line search framework recently proposed in [De Santis et al., 2012]. In the first stage, the algorithm exploits a property of the active-set estimate that ensures a significant reduction in the objective function when setting to the bounds all those variables estimated active. In the second stage, a truncated-Newton strategy is used in the subspace of the variables estimated "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.08498","kind":"arxiv","version":6},"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-18T01:00:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HvmHt9Wui+/s1rBT5WgCkIPBmCHlIHFOaWwVqUyKdordjjgzFRGlisz9kxqa1T015aTjxH1HxvjZ62XcGLqeDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T18:26:27.652540Z"},"content_sha256":"34440f5e5a05645cd29855d9fd855d09030c9803a076fc676a5052e23baeed17","schema_version":"1.0","event_id":"sha256:34440f5e5a05645cd29855d9fd855d09030c9803a076fc676a5052e23baeed17"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BZCAIZJ4SDB5PU6GJ5V3WTOXFT/bundle.json","state_url":"https://pith.science/pith/BZCAIZJ4SDB5PU6GJ5V3WTOXFT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BZCAIZJ4SDB5PU6GJ5V3WTOXFT/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-06-04T18:26:27Z","links":{"resolver":"https://pith.science/pith/BZCAIZJ4SDB5PU6GJ5V3WTOXFT","bundle":"https://pith.science/pith/BZCAIZJ4SDB5PU6GJ5V3WTOXFT/bundle.json","state":"https://pith.science/pith/BZCAIZJ4SDB5PU6GJ5V3WTOXFT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BZCAIZJ4SDB5PU6GJ5V3WTOXFT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:BZCAIZJ4SDB5PU6GJ5V3WTOXFT","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":"cdf5511f9c5169f947374bb8bc7e585df838318fe106c42b70428a108917343a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-07-28T15:16:27Z","title_canon_sha256":"f1a2865fc129e15633336e10a2994dd0121c615692184fe557b6451ed51c1fdf"},"schema_version":"1.0","source":{"id":"1607.08498","kind":"arxiv","version":6}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.08498","created_at":"2026-05-18T01:00:05Z"},{"alias_kind":"arxiv_version","alias_value":"1607.08498v6","created_at":"2026-05-18T01:00:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.08498","created_at":"2026-05-18T01:00:05Z"},{"alias_kind":"pith_short_12","alias_value":"BZCAIZJ4SDB5","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_16","alias_value":"BZCAIZJ4SDB5PU6G","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_8","alias_value":"BZCAIZJ4","created_at":"2026-05-18T12:30:09Z"}],"graph_snapshots":[{"event_id":"sha256:34440f5e5a05645cd29855d9fd855d09030c9803a076fc676a5052e23baeed17","target":"graph","created_at":"2026-05-18T01:00:05Z","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":"In this paper, we describe a two-stage method for solving optimization problems with bound constraints. It combines the active-set estimate described in [Facchinei and Lucidi, 1995] with a modification of the non-monotone line search framework recently proposed in [De Santis et al., 2012]. In the first stage, the algorithm exploits a property of the active-set estimate that ensures a significant reduction in the objective function when setting to the bounds all those variables estimated active. In the second stage, a truncated-Newton strategy is used in the subspace of the variables estimated ","authors_text":"Andrea Cristofari, Francesco Rinaldi, Marianna De Santis, Stefano Lucidi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-07-28T15:16:27Z","title":"A Two-Stage Active-Set Algorithm for Bound-Constrained Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.08498","kind":"arxiv","version":6},"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:92df4e44439aa105965962ca824508c9e390cea9de50d531ed0a2183e1eb0aeb","target":"record","created_at":"2026-05-18T01:00:05Z","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":"cdf5511f9c5169f947374bb8bc7e585df838318fe106c42b70428a108917343a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-07-28T15:16:27Z","title_canon_sha256":"f1a2865fc129e15633336e10a2994dd0121c615692184fe557b6451ed51c1fdf"},"schema_version":"1.0","source":{"id":"1607.08498","kind":"arxiv","version":6}},"canonical_sha256":"0e4404653c90c3d7d3c64f6bbb4dd72ce4c51f833c88a265782e82bc782507cf","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0e4404653c90c3d7d3c64f6bbb4dd72ce4c51f833c88a265782e82bc782507cf","first_computed_at":"2026-05-18T01:00:05.550417Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:00:05.550417Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"MKq7XF6ABQtSMPuqWdRcAmAzJxQQT0YAnRB9pVwC4G38m0lnqWqemGKcU0I1NeADh8eq8ClJh6f8EgmckIPfDg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:00:05.551044Z","signed_message":"canonical_sha256_bytes"},"source_id":"1607.08498","source_kind":"arxiv","source_version":6}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:92df4e44439aa105965962ca824508c9e390cea9de50d531ed0a2183e1eb0aeb","sha256:34440f5e5a05645cd29855d9fd855d09030c9803a076fc676a5052e23baeed17"],"state_sha256":"0b1bf7addd7839bfeba1d0a23ab8ff71a9859a7c7a9e57b46d03441983571a9d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Xs7IOruSISUreOtfoXIiqS7hRygBN2Ff2bYqB74H+dwsomRQjBXOVZmyQBe62CR2gXcSTx3w0UeS0j596TmFBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T18:26:27.654572Z","bundle_sha256":"5ef6b96bf341ff53457a13853b23f3bee75eed4f12abc8dcabbeebc4ecc8704a"}}