{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:6RQJVL5PTJD2PEWEIBPU4GX6GH","short_pith_number":"pith:6RQJVL5P","schema_version":"1.0","canonical_sha256":"f4609aafaf9a47a792c4405f4e1afe31d3b35edc048f3149957711475ff75bab","source":{"kind":"arxiv","id":"2206.07195","version":1},"attestation_state":"computed","paper":{"title":"Tearing Apart NOTEARS: Controlling the Graph Prediction via Variance Manipulation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Devendra Singh Dhami, Jonas Seng, Kristian Kersting, Matej Ze\\v{c}evi\\'c","submitted_at":"2022-06-14T22:53:05Z","abstract_excerpt":"Simulations are ubiquitous in machine learning. Especially in graph learning, simulations of Directed Acyclic Graphs (DAG) are being deployed for evaluating new algorithms. In the literature, it was recently argued that continuous-optimization approaches to structure discovery such as NOTEARS might be exploiting the sortability of the variable's variances in the available data due to their use of least square losses. Specifically, since structure discovery is a key problem in science and beyond, we want to be invariant to the scale being used for measuring our data (e.g. meter versus centimete"},"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":"2206.07195","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-06-14T22:53:05Z","cross_cats_sorted":[],"title_canon_sha256":"81ba1f57eed4ca2fec887c1bc4ce5c03fd4414c84634c567428fc6f4815c2ca0","abstract_canon_sha256":"3c8602c29cd2522b116fb6dd4e91fedeb83f7fc1edeb8b89c4f06374e16aa770"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:32:01.987106Z","signature_b64":"vcwfUZ0bbrtKzHXenBq0Xwkoq6+0Qs2TxxLg2YM01jAi1UrGo9U91Ig5XB+hds0s2nXG23O2EUd8Gk3/Px7NCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f4609aafaf9a47a792c4405f4e1afe31d3b35edc048f3149957711475ff75bab","last_reissued_at":"2026-07-05T04:32:01.986617Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:32:01.986617Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Tearing Apart NOTEARS: Controlling the Graph Prediction via Variance Manipulation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Devendra Singh Dhami, Jonas Seng, Kristian Kersting, Matej Ze\\v{c}evi\\'c","submitted_at":"2022-06-14T22:53:05Z","abstract_excerpt":"Simulations are ubiquitous in machine learning. Especially in graph learning, simulations of Directed Acyclic Graphs (DAG) are being deployed for evaluating new algorithms. In the literature, it was recently argued that continuous-optimization approaches to structure discovery such as NOTEARS might be exploiting the sortability of the variable's variances in the available data due to their use of least square losses. Specifically, since structure discovery is a key problem in science and beyond, we want to be invariant to the scale being used for measuring our data (e.g. meter versus centimete"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2206.07195","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/2206.07195/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":"2206.07195","created_at":"2026-07-05T04:32:01.986683+00:00"},{"alias_kind":"arxiv_version","alias_value":"2206.07195v1","created_at":"2026-07-05T04:32:01.986683+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2206.07195","created_at":"2026-07-05T04:32:01.986683+00:00"},{"alias_kind":"pith_short_12","alias_value":"6RQJVL5PTJD2","created_at":"2026-07-05T04:32:01.986683+00:00"},{"alias_kind":"pith_short_16","alias_value":"6RQJVL5PTJD2PEWE","created_at":"2026-07-05T04:32:01.986683+00:00"},{"alias_kind":"pith_short_8","alias_value":"6RQJVL5P","created_at":"2026-07-05T04:32:01.986683+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.27477","citing_title":"Iterative Causal Discovery: Per-Edge Impossibility Certificates, Tier-Aware Oracle Queries, and the $1+K$ Lower Bound","ref_index":20,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/6RQJVL5PTJD2PEWEIBPU4GX6GH","json":"https://pith.science/pith/6RQJVL5PTJD2PEWEIBPU4GX6GH.json","graph_json":"https://pith.science/api/pith-number/6RQJVL5PTJD2PEWEIBPU4GX6GH/graph.json","events_json":"https://pith.science/api/pith-number/6RQJVL5PTJD2PEWEIBPU4GX6GH/events.json","paper":"https://pith.science/paper/6RQJVL5P"},"agent_actions":{"view_html":"https://pith.science/pith/6RQJVL5PTJD2PEWEIBPU4GX6GH","download_json":"https://pith.science/pith/6RQJVL5PTJD2PEWEIBPU4GX6GH.json","view_paper":"https://pith.science/paper/6RQJVL5P","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2206.07195&json=true","fetch_graph":"https://pith.science/api/pith-number/6RQJVL5PTJD2PEWEIBPU4GX6GH/graph.json","fetch_events":"https://pith.science/api/pith-number/6RQJVL5PTJD2PEWEIBPU4GX6GH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6RQJVL5PTJD2PEWEIBPU4GX6GH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6RQJVL5PTJD2PEWEIBPU4GX6GH/action/storage_attestation","attest_author":"https://pith.science/pith/6RQJVL5PTJD2PEWEIBPU4GX6GH/action/author_attestation","sign_citation":"https://pith.science/pith/6RQJVL5PTJD2PEWEIBPU4GX6GH/action/citation_signature","submit_replication":"https://pith.science/pith/6RQJVL5PTJD2PEWEIBPU4GX6GH/action/replication_record"}},"created_at":"2026-07-05T04:32:01.986683+00:00","updated_at":"2026-07-05T04:32:01.986683+00:00"}