{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:HVDAWQH462BRATAHLOSRMAS52N","short_pith_number":"pith:HVDAWQH4","canonical_record":{"source":{"id":"2408.05474","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-08-10T07:59:43Z","cross_cats_sorted":["cs.SI"],"title_canon_sha256":"1ce9876b9a2412f37e7e7f4d63911f5fec9b4814df0addb122c7927ae1467a14","abstract_canon_sha256":"e52cc51e8b05728ffc38e567748e5bebd9e2fd767a463613961a08b2fd6b7217"},"schema_version":"1.0"},"canonical_sha256":"3d460b40fcf683104c075ba516025dd359eb55e7bb2455c2c842b6dae2ef5c13","source":{"kind":"arxiv","id":"2408.05474","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2408.05474","created_at":"2026-07-05T12:02:35Z"},{"alias_kind":"arxiv_version","alias_value":"2408.05474v1","created_at":"2026-07-05T12:02:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2408.05474","created_at":"2026-07-05T12:02:35Z"},{"alias_kind":"pith_short_12","alias_value":"HVDAWQH462BR","created_at":"2026-07-05T12:02:35Z"},{"alias_kind":"pith_short_16","alias_value":"HVDAWQH462BRATAH","created_at":"2026-07-05T12:02:35Z"},{"alias_kind":"pith_short_8","alias_value":"HVDAWQH4","created_at":"2026-07-05T12:02:35Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:HVDAWQH462BRATAHLOSRMAS52N","target":"record","payload":{"canonical_record":{"source":{"id":"2408.05474","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-08-10T07:59:43Z","cross_cats_sorted":["cs.SI"],"title_canon_sha256":"1ce9876b9a2412f37e7e7f4d63911f5fec9b4814df0addb122c7927ae1467a14","abstract_canon_sha256":"e52cc51e8b05728ffc38e567748e5bebd9e2fd767a463613961a08b2fd6b7217"},"schema_version":"1.0"},"canonical_sha256":"3d460b40fcf683104c075ba516025dd359eb55e7bb2455c2c842b6dae2ef5c13","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T12:02:35.146545Z","signature_b64":"gjmTlsy9FR9qZTm/irW97LcRMe3nmsPt93EA4A23+KRV6Wh6lq5QsvFB5Q0YDLaChU/+Z3Ym5khuR5Q63AKJCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3d460b40fcf683104c075ba516025dd359eb55e7bb2455c2c842b6dae2ef5c13","last_reissued_at":"2026-07-05T12:02:35.145990Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T12:02:35.145990Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2408.05474","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-05T12:02:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MRcnI/fk+AtFM7TR+X5PvifCThXDT6/tGa2EmTTlRi9mdlVEGCWi96wfDChJsHcJq2T/G5GRsMk0/F//0vbgDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T18:38:48.473028Z"},"content_sha256":"cd28d6ad63c3e09ccbe302e8caebf3e4819b8d66daba2ff180cb3b925474d7ef","schema_version":"1.0","event_id":"sha256:cd28d6ad63c3e09ccbe302e8caebf3e4819b8d66daba2ff180cb3b925474d7ef"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:HVDAWQH462BRATAHLOSRMAS52N","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Structural Feature-Based Approach for Comprehensive Graph Classification","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.SI"],"primary_cat":"cs.LG","authors_text":"Md. Nahid Hasan, Pitambar Khanra, Saiful Islam","submitted_at":"2024-08-10T07:59:43Z","abstract_excerpt":"The increasing prevalence of graph-structured data across various domains has intensified greater interest in graph classification tasks. While numerous sophisticated graph learning methods have emerged, their complexity often hinders practical implementation. In this article, we address this challenge by proposing a method that constructs feature vectors based on fundamental graph structural properties. We demonstrate that these features, despite their simplicity, are powerful enough to capture the intrinsic characteristics of graphs within the same class. We explore the efficacy of our appro"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2408.05474","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/2408.05474/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-05T12:02:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GeXpTlZEb+VlC73vI/aC5X8AGfrjNxKj7chrCT6C36avbooCA3YFF7goiPAMHf313YrF8/zqjI4TZpFQsH2SAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T18:38:48.473429Z"},"content_sha256":"eb59153651dced4b23e5e7cf49929d4c8030b9847cb0528cf61ac2c1226fdd48","schema_version":"1.0","event_id":"sha256:eb59153651dced4b23e5e7cf49929d4c8030b9847cb0528cf61ac2c1226fdd48"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HVDAWQH462BRATAHLOSRMAS52N/bundle.json","state_url":"https://pith.science/pith/HVDAWQH462BRATAHLOSRMAS52N/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HVDAWQH462BRATAHLOSRMAS52N/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-06T18:38:48Z","links":{"resolver":"https://pith.science/pith/HVDAWQH462BRATAHLOSRMAS52N","bundle":"https://pith.science/pith/HVDAWQH462BRATAHLOSRMAS52N/bundle.json","state":"https://pith.science/pith/HVDAWQH462BRATAHLOSRMAS52N/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HVDAWQH462BRATAHLOSRMAS52N/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:HVDAWQH462BRATAHLOSRMAS52N","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":"e52cc51e8b05728ffc38e567748e5bebd9e2fd767a463613961a08b2fd6b7217","cross_cats_sorted":["cs.SI"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-08-10T07:59:43Z","title_canon_sha256":"1ce9876b9a2412f37e7e7f4d63911f5fec9b4814df0addb122c7927ae1467a14"},"schema_version":"1.0","source":{"id":"2408.05474","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2408.05474","created_at":"2026-07-05T12:02:35Z"},{"alias_kind":"arxiv_version","alias_value":"2408.05474v1","created_at":"2026-07-05T12:02:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2408.05474","created_at":"2026-07-05T12:02:35Z"},{"alias_kind":"pith_short_12","alias_value":"HVDAWQH462BR","created_at":"2026-07-05T12:02:35Z"},{"alias_kind":"pith_short_16","alias_value":"HVDAWQH462BRATAH","created_at":"2026-07-05T12:02:35Z"},{"alias_kind":"pith_short_8","alias_value":"HVDAWQH4","created_at":"2026-07-05T12:02:35Z"}],"graph_snapshots":[{"event_id":"sha256:eb59153651dced4b23e5e7cf49929d4c8030b9847cb0528cf61ac2c1226fdd48","target":"graph","created_at":"2026-07-05T12:02:35Z","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/2408.05474/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The increasing prevalence of graph-structured data across various domains has intensified greater interest in graph classification tasks. While numerous sophisticated graph learning methods have emerged, their complexity often hinders practical implementation. In this article, we address this challenge by proposing a method that constructs feature vectors based on fundamental graph structural properties. We demonstrate that these features, despite their simplicity, are powerful enough to capture the intrinsic characteristics of graphs within the same class. We explore the efficacy of our appro","authors_text":"Md. Nahid Hasan, Pitambar Khanra, Saiful Islam","cross_cats":["cs.SI"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-08-10T07:59:43Z","title":"A Structural Feature-Based Approach for Comprehensive Graph Classification"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2408.05474","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:cd28d6ad63c3e09ccbe302e8caebf3e4819b8d66daba2ff180cb3b925474d7ef","target":"record","created_at":"2026-07-05T12:02:35Z","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":"e52cc51e8b05728ffc38e567748e5bebd9e2fd767a463613961a08b2fd6b7217","cross_cats_sorted":["cs.SI"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-08-10T07:59:43Z","title_canon_sha256":"1ce9876b9a2412f37e7e7f4d63911f5fec9b4814df0addb122c7927ae1467a14"},"schema_version":"1.0","source":{"id":"2408.05474","kind":"arxiv","version":1}},"canonical_sha256":"3d460b40fcf683104c075ba516025dd359eb55e7bb2455c2c842b6dae2ef5c13","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3d460b40fcf683104c075ba516025dd359eb55e7bb2455c2c842b6dae2ef5c13","first_computed_at":"2026-07-05T12:02:35.145990Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T12:02:35.145990Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"gjmTlsy9FR9qZTm/irW97LcRMe3nmsPt93EA4A23+KRV6Wh6lq5QsvFB5Q0YDLaChU/+Z3Ym5khuR5Q63AKJCw==","signature_status":"signed_v1","signed_at":"2026-07-05T12:02:35.146545Z","signed_message":"canonical_sha256_bytes"},"source_id":"2408.05474","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cd28d6ad63c3e09ccbe302e8caebf3e4819b8d66daba2ff180cb3b925474d7ef","sha256:eb59153651dced4b23e5e7cf49929d4c8030b9847cb0528cf61ac2c1226fdd48"],"state_sha256":"1b943fc0ad9208f81fa9cfc383a064d9a89db9cabd8d7d51694b9424a2238b99"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"J6wUj9VE+vGCTkZIXDAewJs8oYE5bXute5nPAN6L2Jz05/l+dQqafu5itXn/J4rJhH/9hgq9tczYdQjndujmBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-06T18:38:48.475522Z","bundle_sha256":"4cd2942cda4bab411098b4cb45df294b29eb71e8619a52e75c3bc08af431f64a"}}