{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:6AQ7EXOSTAHWUOX32HQNW3PE32","short_pith_number":"pith:6AQ7EXOS","schema_version":"1.0","canonical_sha256":"f021f25dd2980f6a3afbd1e0db6de4dea555e08478cd4b19e1b284e430448962","source":{"kind":"arxiv","id":"2608.12757","version":1},"attestation_state":"computed","paper":{"title":"Difference-of-Convex Regularization for Graph Learning by Differentiable Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"math.OC","authors_text":"Chee Wei Tan, Liping Tao","submitted_at":"2026-08-13T03:10:05Z","abstract_excerpt":"Laplacian-regularized minimization is fundamental in signal processing and machine learning, but is limited by the dense and ill-conditioned nature of the graph Laplacian pseudoinverse. While the Laplacian itself is sparse, its pseudoinverse is dense and often ill-conditioned, rendering direct computation impractical at scale. Moreover, pseudoinverse learning is more challenging than Laplacian learning. To address this challenge, this paper considers the setting where the graph Laplacian is given and proposes a Difference-of-Convex Regularizer (DCR) graph learning framework that approximates t"},"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":"2608.12757","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2026-08-13T03:10:05Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"4721fc4620e851f94191479399e9485f29aa029d69d8bd7bf4c83c713e28f395","abstract_canon_sha256":"83b7c2d9efae6304c974a32f5e58550fcb3466580ad4dc40bcf804e5411a9e43"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-08-14T00:47:33.415544Z","signature_b64":"k1zVNP9ZUjx91d/iiojYcgpen2UC9y2m7WMzOdNtIbk5Y8M1KDtAjRczGgUJ0GHI0/UHAn0mKimCReAhoJNvAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f021f25dd2980f6a3afbd1e0db6de4dea555e08478cd4b19e1b284e430448962","last_reissued_at":"2026-08-14T00:47:33.397013Z","signature_status":"signed_v1","first_computed_at":"2026-08-14T00:47:33.397013Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Difference-of-Convex Regularization for Graph Learning by Differentiable Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"math.OC","authors_text":"Chee Wei Tan, Liping Tao","submitted_at":"2026-08-13T03:10:05Z","abstract_excerpt":"Laplacian-regularized minimization is fundamental in signal processing and machine learning, but is limited by the dense and ill-conditioned nature of the graph Laplacian pseudoinverse. While the Laplacian itself is sparse, its pseudoinverse is dense and often ill-conditioned, rendering direct computation impractical at scale. Moreover, pseudoinverse learning is more challenging than Laplacian learning. To address this challenge, this paper considers the setting where the graph Laplacian is given and proposes a Difference-of-Convex Regularizer (DCR) graph learning framework that approximates t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2608.12757","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/2608.12757/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":"2608.12757","created_at":"2026-08-14T00:47:33.407280+00:00"},{"alias_kind":"arxiv_version","alias_value":"2608.12757v1","created_at":"2026-08-14T00:47:33.407280+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.12757","created_at":"2026-08-14T00:47:33.407280+00:00"},{"alias_kind":"pith_short_12","alias_value":"6AQ7EXOSTAHW","created_at":"2026-08-14T00:47:33.407280+00:00"},{"alias_kind":"pith_short_16","alias_value":"6AQ7EXOSTAHWUOX3","created_at":"2026-08-14T00:47:33.407280+00:00"},{"alias_kind":"pith_short_8","alias_value":"6AQ7EXOS","created_at":"2026-08-14T00:47:33.407280+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/6AQ7EXOSTAHWUOX32HQNW3PE32","json":"https://pith.science/pith/6AQ7EXOSTAHWUOX32HQNW3PE32.json","graph_json":"https://pith.science/api/pith-number/6AQ7EXOSTAHWUOX32HQNW3PE32/graph.json","events_json":"https://pith.science/api/pith-number/6AQ7EXOSTAHWUOX32HQNW3PE32/events.json","paper":"https://pith.science/paper/6AQ7EXOS"},"agent_actions":{"view_html":"https://pith.science/pith/6AQ7EXOSTAHWUOX32HQNW3PE32","download_json":"https://pith.science/pith/6AQ7EXOSTAHWUOX32HQNW3PE32.json","view_paper":"https://pith.science/paper/6AQ7EXOS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2608.12757&json=true","fetch_graph":"https://pith.science/api/pith-number/6AQ7EXOSTAHWUOX32HQNW3PE32/graph.json","fetch_events":"https://pith.science/api/pith-number/6AQ7EXOSTAHWUOX32HQNW3PE32/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6AQ7EXOSTAHWUOX32HQNW3PE32/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6AQ7EXOSTAHWUOX32HQNW3PE32/action/storage_attestation","attest_author":"https://pith.science/pith/6AQ7EXOSTAHWUOX32HQNW3PE32/action/author_attestation","sign_citation":"https://pith.science/pith/6AQ7EXOSTAHWUOX32HQNW3PE32/action/citation_signature","submit_replication":"https://pith.science/pith/6AQ7EXOSTAHWUOX32HQNW3PE32/action/replication_record"}},"created_at":"2026-08-14T00:47:33.407280+00:00","updated_at":"2026-08-14T00:47:33.407280+00:00"}