{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:LOSPETMF4SC2WCC7S5U6XWIFQE","short_pith_number":"pith:LOSPETMF","schema_version":"1.0","canonical_sha256":"5ba4f24d85e485ab085f9769ebd905811c772dd976ff54ccb4fbdc3473bc035d","source":{"kind":"arxiv","id":"2205.13901","version":1},"attestation_state":"computed","paper":{"title":"Bias Reduction via Cooperative Bargaining in Synthetic Graph Dataset Generation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Axel Wassington, Sergi Abadal","submitted_at":"2022-05-27T11:12:50Z","abstract_excerpt":"In general, to draw robust conclusions from a dataset, all the analyzed population must be represented on said dataset. Having a dataset that does not fulfill this condition normally leads to selection bias. Additionally, graphs have been used to model a wide variety of problems. Although synthetic graphs can be used to augment available real graph datasets to overcome selection bias, the generation of unbiased synthetic datasets is complex with current tools. In this work, we propose a method to find a synthetic graph dataset that has an even representation of graphs with different metrics. 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":"2205.13901","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2022-05-27T11:12:50Z","cross_cats_sorted":[],"title_canon_sha256":"58b17c075b58746c6ae8a1f9f4d1adf6b1508276a7b6dfa8f1f80b73a08a3840","abstract_canon_sha256":"a7940b5b25bcf14804625d43e70714b1add4cbeee21fe6e6f9deb89bc5012005"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:26:53.362789Z","signature_b64":"1eX2pJ8s4I12T1qvPLr/YUM+QnRU8r2VaXn2nKDNobGTu9yDA/wGKvv/awwmDZro8KdAmc4DdidnNBc/F62OAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5ba4f24d85e485ab085f9769ebd905811c772dd976ff54ccb4fbdc3473bc035d","last_reissued_at":"2026-07-05T04:26:53.362371Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:26:53.362371Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Bias Reduction via Cooperative Bargaining in Synthetic Graph Dataset Generation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Axel Wassington, Sergi Abadal","submitted_at":"2022-05-27T11:12:50Z","abstract_excerpt":"In general, to draw robust conclusions from a dataset, all the analyzed population must be represented on said dataset. Having a dataset that does not fulfill this condition normally leads to selection bias. Additionally, graphs have been used to model a wide variety of problems. Although synthetic graphs can be used to augment available real graph datasets to overcome selection bias, the generation of unbiased synthetic datasets is complex with current tools. In this work, we propose a method to find a synthetic graph dataset that has an even representation of graphs with different metrics. T"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2205.13901","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/2205.13901/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":"2205.13901","created_at":"2026-07-05T04:26:53.362428+00:00"},{"alias_kind":"arxiv_version","alias_value":"2205.13901v1","created_at":"2026-07-05T04:26:53.362428+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2205.13901","created_at":"2026-07-05T04:26:53.362428+00:00"},{"alias_kind":"pith_short_12","alias_value":"LOSPETMF4SC2","created_at":"2026-07-05T04:26:53.362428+00:00"},{"alias_kind":"pith_short_16","alias_value":"LOSPETMF4SC2WCC7","created_at":"2026-07-05T04:26:53.362428+00:00"},{"alias_kind":"pith_short_8","alias_value":"LOSPETMF","created_at":"2026-07-05T04:26:53.362428+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2411.16342","citing_title":"A Data-Driven Approach to Dataflow-Aware Online Scheduling for Graph Neural Network Inference","ref_index":24,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/LOSPETMF4SC2WCC7S5U6XWIFQE","json":"https://pith.science/pith/LOSPETMF4SC2WCC7S5U6XWIFQE.json","graph_json":"https://pith.science/api/pith-number/LOSPETMF4SC2WCC7S5U6XWIFQE/graph.json","events_json":"https://pith.science/api/pith-number/LOSPETMF4SC2WCC7S5U6XWIFQE/events.json","paper":"https://pith.science/paper/LOSPETMF"},"agent_actions":{"view_html":"https://pith.science/pith/LOSPETMF4SC2WCC7S5U6XWIFQE","download_json":"https://pith.science/pith/LOSPETMF4SC2WCC7S5U6XWIFQE.json","view_paper":"https://pith.science/paper/LOSPETMF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2205.13901&json=true","fetch_graph":"https://pith.science/api/pith-number/LOSPETMF4SC2WCC7S5U6XWIFQE/graph.json","fetch_events":"https://pith.science/api/pith-number/LOSPETMF4SC2WCC7S5U6XWIFQE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LOSPETMF4SC2WCC7S5U6XWIFQE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LOSPETMF4SC2WCC7S5U6XWIFQE/action/storage_attestation","attest_author":"https://pith.science/pith/LOSPETMF4SC2WCC7S5U6XWIFQE/action/author_attestation","sign_citation":"https://pith.science/pith/LOSPETMF4SC2WCC7S5U6XWIFQE/action/citation_signature","submit_replication":"https://pith.science/pith/LOSPETMF4SC2WCC7S5U6XWIFQE/action/replication_record"}},"created_at":"2026-07-05T04:26:53.362428+00:00","updated_at":"2026-07-05T04:26:53.362428+00:00"}