{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:5DMT4Y3TG4TBATCNEPBCFJL4X4","short_pith_number":"pith:5DMT4Y3T","canonical_record":{"source":{"id":"2503.02397","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-03-04T08:40:42Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"748209554559134153b61a13d6186acc8703c4d2d43609625a3281ffd2b7d2c3","abstract_canon_sha256":"59e4e8fd1e9df844e03b19f49a67b7b11e7d0f9eb4a85b0969d8a59051d34f76"},"schema_version":"1.0"},"canonical_sha256":"e8d93e63733726104c4d23c222a57cbf1790be2451a444a3a57c021d5a545778","source":{"kind":"arxiv","id":"2503.02397","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2503.02397","created_at":"2026-07-05T10:23:43Z"},{"alias_kind":"arxiv_version","alias_value":"2503.02397v1","created_at":"2026-07-05T10:23:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2503.02397","created_at":"2026-07-05T10:23:43Z"},{"alias_kind":"pith_short_12","alias_value":"5DMT4Y3TG4TB","created_at":"2026-07-05T10:23:43Z"},{"alias_kind":"pith_short_16","alias_value":"5DMT4Y3TG4TBATCN","created_at":"2026-07-05T10:23:43Z"},{"alias_kind":"pith_short_8","alias_value":"5DMT4Y3T","created_at":"2026-07-05T10:23:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:5DMT4Y3TG4TBATCNEPBCFJL4X4","target":"record","payload":{"canonical_record":{"source":{"id":"2503.02397","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-03-04T08:40:42Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"748209554559134153b61a13d6186acc8703c4d2d43609625a3281ffd2b7d2c3","abstract_canon_sha256":"59e4e8fd1e9df844e03b19f49a67b7b11e7d0f9eb4a85b0969d8a59051d34f76"},"schema_version":"1.0"},"canonical_sha256":"e8d93e63733726104c4d23c222a57cbf1790be2451a444a3a57c021d5a545778","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:23:43.086695Z","signature_b64":"eMDYpyQLCQ0oO+ZL2Du7T1EXEuuurInaMNAsMD1/D1MD5EF1FoXLqB8OexuLBEIJSBlCE2FXeYpUddkccLLiCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e8d93e63733726104c4d23c222a57cbf1790be2451a444a3a57c021d5a545778","last_reissued_at":"2026-07-05T10:23:43.085842Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:23:43.085842Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2503.02397","source_version":1,"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-07-05T10:23:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qDz1IZR4mge5R5Sk3JlgqhVPV+HZX1foXZnwh1cgDb8B2pE8VDmuol1034y7fU+wi6jOig2RGWivwEl6kEbCBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T00:28:51.536188Z"},"content_sha256":"3538d10a462470f101c7f1d430c3d4625f296ce623440db8ec73ad1ab2a03dc5","schema_version":"1.0","event_id":"sha256:3538d10a462470f101c7f1d430c3d4625f296ce623440db8ec73ad1ab2a03dc5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:5DMT4Y3TG4TBATCNEPBCFJL4X4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Binary Classification Social Network Dataset for Graph Machine Learning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Adnan Ali, AlMotasem Bellah Al Ajlouni, Huanhuan Chen, Jinglong Li","submitted_at":"2025-03-04T08:40:42Z","abstract_excerpt":"Social networks have a vast range of applications with graphs. The available benchmark datasets are citation, co-occurrence, e-commerce networks, etc, with classes ranging from 3 to 15. However, there is no benchmark classification social network dataset for graph machine learning. This paper fills the gap and presents the Binary Classification Social Network Dataset (\\textit{BiSND}), designed for graph machine learning applications to predict binary classes. We present the BiSND in \\textit{tabular and graph} formats to verify its robustness across classical and advanced machine learning. We e"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2503.02397","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/2503.02397/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"},"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-07-05T10:23:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fJw+JexDEkUoQAlMy6rxvTxP4j49AG7dwcTM7c3b6gXq/6xWu5TpfELC1GGmbz9veWAbnGxvOx2pZdGCj4m1AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T00:28:51.537166Z"},"content_sha256":"acd529eec3f30c39103d33ab76381ad12a375aa08ed4f83984a8d6d998e2c405","schema_version":"1.0","event_id":"sha256:acd529eec3f30c39103d33ab76381ad12a375aa08ed4f83984a8d6d998e2c405"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5DMT4Y3TG4TBATCNEPBCFJL4X4/bundle.json","state_url":"https://pith.science/pith/5DMT4Y3TG4TBATCNEPBCFJL4X4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5DMT4Y3TG4TBATCNEPBCFJL4X4/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-08-10T00:28:51Z","links":{"resolver":"https://pith.science/pith/5DMT4Y3TG4TBATCNEPBCFJL4X4","bundle":"https://pith.science/pith/5DMT4Y3TG4TBATCNEPBCFJL4X4/bundle.json","state":"https://pith.science/pith/5DMT4Y3TG4TBATCNEPBCFJL4X4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5DMT4Y3TG4TBATCNEPBCFJL4X4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:5DMT4Y3TG4TBATCNEPBCFJL4X4","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":"59e4e8fd1e9df844e03b19f49a67b7b11e7d0f9eb4a85b0969d8a59051d34f76","cross_cats_sorted":["cs.AI"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-03-04T08:40:42Z","title_canon_sha256":"748209554559134153b61a13d6186acc8703c4d2d43609625a3281ffd2b7d2c3"},"schema_version":"1.0","source":{"id":"2503.02397","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2503.02397","created_at":"2026-07-05T10:23:43Z"},{"alias_kind":"arxiv_version","alias_value":"2503.02397v1","created_at":"2026-07-05T10:23:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2503.02397","created_at":"2026-07-05T10:23:43Z"},{"alias_kind":"pith_short_12","alias_value":"5DMT4Y3TG4TB","created_at":"2026-07-05T10:23:43Z"},{"alias_kind":"pith_short_16","alias_value":"5DMT4Y3TG4TBATCN","created_at":"2026-07-05T10:23:43Z"},{"alias_kind":"pith_short_8","alias_value":"5DMT4Y3T","created_at":"2026-07-05T10:23:43Z"}],"graph_snapshots":[{"event_id":"sha256:acd529eec3f30c39103d33ab76381ad12a375aa08ed4f83984a8d6d998e2c405","target":"graph","created_at":"2026-07-05T10:23:43Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2503.02397/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Social networks have a vast range of applications with graphs. The available benchmark datasets are citation, co-occurrence, e-commerce networks, etc, with classes ranging from 3 to 15. However, there is no benchmark classification social network dataset for graph machine learning. This paper fills the gap and presents the Binary Classification Social Network Dataset (\\textit{BiSND}), designed for graph machine learning applications to predict binary classes. We present the BiSND in \\textit{tabular and graph} formats to verify its robustness across classical and advanced machine learning. We e","authors_text":"Adnan Ali, AlMotasem Bellah Al Ajlouni, Huanhuan Chen, Jinglong Li","cross_cats":["cs.AI"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-03-04T08:40:42Z","title":"A Binary Classification Social Network Dataset for Graph Machine Learning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2503.02397","kind":"arxiv","version":1},"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:3538d10a462470f101c7f1d430c3d4625f296ce623440db8ec73ad1ab2a03dc5","target":"record","created_at":"2026-07-05T10:23:43Z","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":"59e4e8fd1e9df844e03b19f49a67b7b11e7d0f9eb4a85b0969d8a59051d34f76","cross_cats_sorted":["cs.AI"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-03-04T08:40:42Z","title_canon_sha256":"748209554559134153b61a13d6186acc8703c4d2d43609625a3281ffd2b7d2c3"},"schema_version":"1.0","source":{"id":"2503.02397","kind":"arxiv","version":1}},"canonical_sha256":"e8d93e63733726104c4d23c222a57cbf1790be2451a444a3a57c021d5a545778","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e8d93e63733726104c4d23c222a57cbf1790be2451a444a3a57c021d5a545778","first_computed_at":"2026-07-05T10:23:43.085842Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:23:43.085842Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"eMDYpyQLCQ0oO+ZL2Du7T1EXEuuurInaMNAsMD1/D1MD5EF1FoXLqB8OexuLBEIJSBlCE2FXeYpUddkccLLiCw==","signature_status":"signed_v1","signed_at":"2026-07-05T10:23:43.086695Z","signed_message":"canonical_sha256_bytes"},"source_id":"2503.02397","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3538d10a462470f101c7f1d430c3d4625f296ce623440db8ec73ad1ab2a03dc5","sha256:acd529eec3f30c39103d33ab76381ad12a375aa08ed4f83984a8d6d998e2c405"],"state_sha256":"0e2650b6bb9572984b786f7c9ee260e4c3157988943a515083a1bd9f586296ba"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"31kuLWUdWG2jRdEf1gpVditZ7jaTYCXVLZvpCRPDK8VSaggalrtyzwjzsfZqRppA9qyaQIjA7XVGw4QBLzqYAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-10T00:28:51.547618Z","bundle_sha256":"e07838229f7d57c16d4c93f646e35461962d27db71a22f74af55eaefed380282"}}