{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:J6VBI6UNHOTWKVGSCMADFTBJDL","short_pith_number":"pith:J6VBI6UN","canonical_record":{"source":{"id":"2403.13865","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.SI","submitted_at":"2024-03-20T10:13:54Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"4bf9b07dcc6314bc5952001d60473f8e5f4503be66ae7105bbf942ec296489e0","abstract_canon_sha256":"74382d7f95cbe8afd7675ed2e09048ccc82cc006e14892e9f21c9e9199ec99e6"},"schema_version":"1.0"},"canonical_sha256":"4faa147a8d3ba76554d2130032cc291af72408fca5dbedd383fade743e99438c","source":{"kind":"arxiv","id":"2403.13865","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2403.13865","created_at":"2026-07-05T07:58:51Z"},{"alias_kind":"arxiv_version","alias_value":"2403.13865v1","created_at":"2026-07-05T07:58:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2403.13865","created_at":"2026-07-05T07:58:51Z"},{"alias_kind":"pith_short_12","alias_value":"J6VBI6UNHOTW","created_at":"2026-07-05T07:58:51Z"},{"alias_kind":"pith_short_16","alias_value":"J6VBI6UNHOTWKVGS","created_at":"2026-07-05T07:58:51Z"},{"alias_kind":"pith_short_8","alias_value":"J6VBI6UN","created_at":"2026-07-05T07:58:51Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:J6VBI6UNHOTWKVGSCMADFTBJDL","target":"record","payload":{"canonical_record":{"source":{"id":"2403.13865","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.SI","submitted_at":"2024-03-20T10:13:54Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"4bf9b07dcc6314bc5952001d60473f8e5f4503be66ae7105bbf942ec296489e0","abstract_canon_sha256":"74382d7f95cbe8afd7675ed2e09048ccc82cc006e14892e9f21c9e9199ec99e6"},"schema_version":"1.0"},"canonical_sha256":"4faa147a8d3ba76554d2130032cc291af72408fca5dbedd383fade743e99438c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:58:51.266115Z","signature_b64":"NzPkxhsz/K6qxRQQxUVR9UjpCi2lAMkjcIsJmfFC3FRXm67xo5WpcgCmvRkytfEOhp9fSm+ptpI5IvjFOs3jDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4faa147a8d3ba76554d2130032cc291af72408fca5dbedd383fade743e99438c","last_reissued_at":"2026-07-05T07:58:51.265597Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:58:51.265597Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2403.13865","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-05T07:58:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"s8UByPUxNij9TZxOyMQ2W61K158OnZ4ECC8kQiEWvCp6pLB34ZUu42vzxN7G+j4pyk2YYTKneMB2Jild8nToCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-12T16:12:02.023051Z"},"content_sha256":"ca37627628470e9f288f39236154f528c1523514578b1c3616a3765ba3b50618","schema_version":"1.0","event_id":"sha256:ca37627628470e9f288f39236154f528c1523514578b1c3616a3765ba3b50618"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:J6VBI6UNHOTWKVGSCMADFTBJDL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Graph Neural Network for Crawling Target Nodes in Social Networks","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.SI","authors_text":"Danil Shaikhelislamov, Denis Turdakov, Kirill Lukyanov, Mikhail Drobyshevskiy","submitted_at":"2024-03-20T10:13:54Z","abstract_excerpt":"Social networks crawling is in the focus of active research the last years. One of the challenging task is to collect target nodes in an initially unknown graph given a budget of crawling steps. Predicting a node property based on its partially known neighbourhood is at the heart of a successful crawler. In this paper we adopt graph neural networks for this purpose and show they are competitive to traditional classifiers and are better for individual cases. Additionally we suggest a training sample boosting technique, which helps to diversify the training set at early stages of crawling and th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2403.13865","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/2403.13865/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-05T07:58:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wmiTNFBbrMQM/a7zE/OysbnG3tE1umyqSboUg/KuU0dK5EaxEsnOWv83tbhUSBRE7UXkwOB77381SbRrxTnxBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-12T16:12:02.023439Z"},"content_sha256":"0a7296fab2702432e4a6f7007742cfde1bf71e4f8a9cf99bf0c7f09d6e4310e8","schema_version":"1.0","event_id":"sha256:0a7296fab2702432e4a6f7007742cfde1bf71e4f8a9cf99bf0c7f09d6e4310e8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/J6VBI6UNHOTWKVGSCMADFTBJDL/bundle.json","state_url":"https://pith.science/pith/J6VBI6UNHOTWKVGSCMADFTBJDL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/J6VBI6UNHOTWKVGSCMADFTBJDL/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-07-12T16:12:02Z","links":{"resolver":"https://pith.science/pith/J6VBI6UNHOTWKVGSCMADFTBJDL","bundle":"https://pith.science/pith/J6VBI6UNHOTWKVGSCMADFTBJDL/bundle.json","state":"https://pith.science/pith/J6VBI6UNHOTWKVGSCMADFTBJDL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/J6VBI6UNHOTWKVGSCMADFTBJDL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:J6VBI6UNHOTWKVGSCMADFTBJDL","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":"74382d7f95cbe8afd7675ed2e09048ccc82cc006e14892e9f21c9e9199ec99e6","cross_cats_sorted":["cs.LG"],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.SI","submitted_at":"2024-03-20T10:13:54Z","title_canon_sha256":"4bf9b07dcc6314bc5952001d60473f8e5f4503be66ae7105bbf942ec296489e0"},"schema_version":"1.0","source":{"id":"2403.13865","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2403.13865","created_at":"2026-07-05T07:58:51Z"},{"alias_kind":"arxiv_version","alias_value":"2403.13865v1","created_at":"2026-07-05T07:58:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2403.13865","created_at":"2026-07-05T07:58:51Z"},{"alias_kind":"pith_short_12","alias_value":"J6VBI6UNHOTW","created_at":"2026-07-05T07:58:51Z"},{"alias_kind":"pith_short_16","alias_value":"J6VBI6UNHOTWKVGS","created_at":"2026-07-05T07:58:51Z"},{"alias_kind":"pith_short_8","alias_value":"J6VBI6UN","created_at":"2026-07-05T07:58:51Z"}],"graph_snapshots":[{"event_id":"sha256:0a7296fab2702432e4a6f7007742cfde1bf71e4f8a9cf99bf0c7f09d6e4310e8","target":"graph","created_at":"2026-07-05T07:58:51Z","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/2403.13865/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Social networks crawling is in the focus of active research the last years. One of the challenging task is to collect target nodes in an initially unknown graph given a budget of crawling steps. Predicting a node property based on its partially known neighbourhood is at the heart of a successful crawler. In this paper we adopt graph neural networks for this purpose and show they are competitive to traditional classifiers and are better for individual cases. Additionally we suggest a training sample boosting technique, which helps to diversify the training set at early stages of crawling and th","authors_text":"Danil Shaikhelislamov, Denis Turdakov, Kirill Lukyanov, Mikhail Drobyshevskiy","cross_cats":["cs.LG"],"headline":"","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.SI","submitted_at":"2024-03-20T10:13:54Z","title":"Graph Neural Network for Crawling Target Nodes in Social Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2403.13865","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:ca37627628470e9f288f39236154f528c1523514578b1c3616a3765ba3b50618","target":"record","created_at":"2026-07-05T07:58:51Z","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":"74382d7f95cbe8afd7675ed2e09048ccc82cc006e14892e9f21c9e9199ec99e6","cross_cats_sorted":["cs.LG"],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.SI","submitted_at":"2024-03-20T10:13:54Z","title_canon_sha256":"4bf9b07dcc6314bc5952001d60473f8e5f4503be66ae7105bbf942ec296489e0"},"schema_version":"1.0","source":{"id":"2403.13865","kind":"arxiv","version":1}},"canonical_sha256":"4faa147a8d3ba76554d2130032cc291af72408fca5dbedd383fade743e99438c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4faa147a8d3ba76554d2130032cc291af72408fca5dbedd383fade743e99438c","first_computed_at":"2026-07-05T07:58:51.265597Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:58:51.265597Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"NzPkxhsz/K6qxRQQxUVR9UjpCi2lAMkjcIsJmfFC3FRXm67xo5WpcgCmvRkytfEOhp9fSm+ptpI5IvjFOs3jDw==","signature_status":"signed_v1","signed_at":"2026-07-05T07:58:51.266115Z","signed_message":"canonical_sha256_bytes"},"source_id":"2403.13865","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ca37627628470e9f288f39236154f528c1523514578b1c3616a3765ba3b50618","sha256:0a7296fab2702432e4a6f7007742cfde1bf71e4f8a9cf99bf0c7f09d6e4310e8"],"state_sha256":"25ba8a9335921a7d98d39c318e59d8c0732d605d209978b6edcd82b0dffd6fc9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HbqZxwM21SMSBpD1ClGpRNJmOwMVZM8ZRgydhP3Fu/KstBAdrsxW3mJzIlFohqxWJufURwg8cGSL2L6erCrPCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-12T16:12:02.025809Z","bundle_sha256":"432db5c5d7272139dd92a91839adbc366618a53e0774bf60cbf45696f8bdc1c5"}}