{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:HJ7DQXJ4MY3VSKAPSPQIHH5DMN","short_pith_number":"pith:HJ7DQXJ4","schema_version":"1.0","canonical_sha256":"3a7e385d3c663759280f93e0839fa3637a210afc318545d1f450883777739ec2","source":{"kind":"arxiv","id":"2508.20290","version":1},"attestation_state":"computed","paper":{"title":"Objective Value Change and Shape-Based Accelerated Optimization for the Neural Network Approximation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.NA","math.NA","math.OC"],"primary_cat":"cs.LG","authors_text":"Pengcheng Xie, Zihao Zhou, Zijian Zhou","submitted_at":"2025-08-27T21:51:54Z","abstract_excerpt":"This paper introduce a novel metric of an objective function f, we say VC (value change) to measure the difficulty and approximation affection when conducting an neural network approximation task, and it numerically supports characterizing the local performance and behavior of neural network approximation. Neural networks often suffer from unpredictable local performance, which can hinder their reliability in critical applications. VC addresses this issue by providing a quantifiable measure of local value changes in network behavior, offering insights into the stability and performance for ach"},"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":"2508.20290","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-08-27T21:51:54Z","cross_cats_sorted":["cs.AI","cs.NA","math.NA","math.OC"],"title_canon_sha256":"48cdae7d6dcabd3ed9fb1119d50689e1c28a169c336e5d695f33f2871f31fbf2","abstract_canon_sha256":"02374f411fed2431daac54b4ee54b0f3d73b4eb44e09e851d8c7d58e4778df2c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T12:00:33.709929Z","signature_b64":"djxa4DXOLFkx/e5wkQggZsxuag1bpsbp7f2JIS4WJX5QwojdtfvDeGv0QONRH9Z3qXrR6g2BMRIbaltQkEj7Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3a7e385d3c663759280f93e0839fa3637a210afc318545d1f450883777739ec2","last_reissued_at":"2026-07-05T12:00:33.709374Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T12:00:33.709374Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Objective Value Change and Shape-Based Accelerated Optimization for the Neural Network Approximation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.NA","math.NA","math.OC"],"primary_cat":"cs.LG","authors_text":"Pengcheng Xie, Zihao Zhou, Zijian Zhou","submitted_at":"2025-08-27T21:51:54Z","abstract_excerpt":"This paper introduce a novel metric of an objective function f, we say VC (value change) to measure the difficulty and approximation affection when conducting an neural network approximation task, and it numerically supports characterizing the local performance and behavior of neural network approximation. Neural networks often suffer from unpredictable local performance, which can hinder their reliability in critical applications. VC addresses this issue by providing a quantifiable measure of local value changes in network behavior, offering insights into the stability and performance for ach"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2508.20290","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2508.20290/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2508.20290","created_at":"2026-07-05T12:00:33.709436+00:00"},{"alias_kind":"arxiv_version","alias_value":"2508.20290v1","created_at":"2026-07-05T12:00:33.709436+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.20290","created_at":"2026-07-05T12:00:33.709436+00:00"},{"alias_kind":"pith_short_12","alias_value":"HJ7DQXJ4MY3V","created_at":"2026-07-05T12:00:33.709436+00:00"},{"alias_kind":"pith_short_16","alias_value":"HJ7DQXJ4MY3VSKAP","created_at":"2026-07-05T12:00:33.709436+00:00"},{"alias_kind":"pith_short_8","alias_value":"HJ7DQXJ4","created_at":"2026-07-05T12:00:33.709436+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.19396","citing_title":"Distributed Gradient-Regularized Newton Method: Scheduled Consensus and O(epsilon^{-1}) Global Iteration Complexity","ref_index":46,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/HJ7DQXJ4MY3VSKAPSPQIHH5DMN","json":"https://pith.science/pith/HJ7DQXJ4MY3VSKAPSPQIHH5DMN.json","graph_json":"https://pith.science/api/pith-number/HJ7DQXJ4MY3VSKAPSPQIHH5DMN/graph.json","events_json":"https://pith.science/api/pith-number/HJ7DQXJ4MY3VSKAPSPQIHH5DMN/events.json","paper":"https://pith.science/paper/HJ7DQXJ4"},"agent_actions":{"view_html":"https://pith.science/pith/HJ7DQXJ4MY3VSKAPSPQIHH5DMN","download_json":"https://pith.science/pith/HJ7DQXJ4MY3VSKAPSPQIHH5DMN.json","view_paper":"https://pith.science/paper/HJ7DQXJ4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2508.20290&json=true","fetch_graph":"https://pith.science/api/pith-number/HJ7DQXJ4MY3VSKAPSPQIHH5DMN/graph.json","fetch_events":"https://pith.science/api/pith-number/HJ7DQXJ4MY3VSKAPSPQIHH5DMN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HJ7DQXJ4MY3VSKAPSPQIHH5DMN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HJ7DQXJ4MY3VSKAPSPQIHH5DMN/action/storage_attestation","attest_author":"https://pith.science/pith/HJ7DQXJ4MY3VSKAPSPQIHH5DMN/action/author_attestation","sign_citation":"https://pith.science/pith/HJ7DQXJ4MY3VSKAPSPQIHH5DMN/action/citation_signature","submit_replication":"https://pith.science/pith/HJ7DQXJ4MY3VSKAPSPQIHH5DMN/action/replication_record"}},"created_at":"2026-07-05T12:00:33.709436+00:00","updated_at":"2026-07-05T12:00:33.709436+00:00"}