{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:YKXUFMEWJXR2WWORH6DR2V6DN2","short_pith_number":"pith:YKXUFMEW","canonical_record":{"source":{"id":"2411.12330","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-11-19T08:32:14Z","cross_cats_sorted":[],"title_canon_sha256":"854d09057ad69be9f76d5e04fa0a03b4be13eabb4c518abda9b399f2d9faad04","abstract_canon_sha256":"a92213326553a94c783cf20774d52f5134ba8122eec677cd747220eea5f50a2e"},"schema_version":"1.0"},"canonical_sha256":"c2af42b0964de3ab59d13f871d57c36ea4f27a2cc9574bd7cd0716039b51c475","source":{"kind":"arxiv","id":"2411.12330","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2411.12330","created_at":"2026-07-05T09:37:19Z"},{"alias_kind":"arxiv_version","alias_value":"2411.12330v1","created_at":"2026-07-05T09:37:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.12330","created_at":"2026-07-05T09:37:19Z"},{"alias_kind":"pith_short_12","alias_value":"YKXUFMEWJXR2","created_at":"2026-07-05T09:37:19Z"},{"alias_kind":"pith_short_16","alias_value":"YKXUFMEWJXR2WWOR","created_at":"2026-07-05T09:37:19Z"},{"alias_kind":"pith_short_8","alias_value":"YKXUFMEW","created_at":"2026-07-05T09:37:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:YKXUFMEWJXR2WWORH6DR2V6DN2","target":"record","payload":{"canonical_record":{"source":{"id":"2411.12330","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-11-19T08:32:14Z","cross_cats_sorted":[],"title_canon_sha256":"854d09057ad69be9f76d5e04fa0a03b4be13eabb4c518abda9b399f2d9faad04","abstract_canon_sha256":"a92213326553a94c783cf20774d52f5134ba8122eec677cd747220eea5f50a2e"},"schema_version":"1.0"},"canonical_sha256":"c2af42b0964de3ab59d13f871d57c36ea4f27a2cc9574bd7cd0716039b51c475","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:37:19.682234Z","signature_b64":"BMwAzTk63rlE8B5t45ky5Ml0S2hEpB8fvxDWua8F0DAg4yUxSUT13L5wDpJHK/7colkXb2nurNdPGteXK6RECQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c2af42b0964de3ab59d13f871d57c36ea4f27a2cc9574bd7cd0716039b51c475","last_reissued_at":"2026-07-05T09:37:19.681203Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:37:19.681203Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2411.12330","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-05T09:37:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bCwqRbm3loL6Jq4tdVXH2hiX8PNHm4vByinnfik1qYVlq1Ur1iet2GQPQfSWyHuuKLRYTkopqDh8ZrHrWjuuAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T12:38:16.148746Z"},"content_sha256":"b42d0d7994c8a6c962a1e548455c088825e4786f1e9fb0e8061d0009f7c791fe","schema_version":"1.0","event_id":"sha256:b42d0d7994c8a6c962a1e548455c088825e4786f1e9fb0e8061d0009f7c791fe"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:YKXUFMEWJXR2WWORH6DR2V6DN2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Graph as a feature: improving node classification with non-neural graph-aware logistic regression","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Simon Delarue, Thomas Bonald, Tiphaine Viard","submitted_at":"2024-11-19T08:32:14Z","abstract_excerpt":"Graph Neural Networks (GNNs) and their message passing framework that leverages both structural and feature information, have become a standard method for solving graph-based machine learning problems. However, these approaches still struggle to generalise well beyond datasets that exhibit strong homophily, where nodes of the same class tend to connect. This limitation has led to the development of complex neural architectures that pose challenges in terms of efficiency and scalability. In response to these limitations, we focus on simpler and more scalable approaches and introduce Graph-aware"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.12330","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/2411.12330/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-05T09:37:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7xaEcy7cXKelUXYVyoY8bMG+MzN5z1+0quhn7RtPE/xVAjwssAycBnwzhvbWaCQNc5jmzn6GU9thxhQp0bFRBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T12:38:16.149917Z"},"content_sha256":"82eba927203f62aa91338f71c854b40bd9ac6575e61ee0ab6289e9563fc88bad","schema_version":"1.0","event_id":"sha256:82eba927203f62aa91338f71c854b40bd9ac6575e61ee0ab6289e9563fc88bad"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YKXUFMEWJXR2WWORH6DR2V6DN2/bundle.json","state_url":"https://pith.science/pith/YKXUFMEWJXR2WWORH6DR2V6DN2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YKXUFMEWJXR2WWORH6DR2V6DN2/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-14T12:38:16Z","links":{"resolver":"https://pith.science/pith/YKXUFMEWJXR2WWORH6DR2V6DN2","bundle":"https://pith.science/pith/YKXUFMEWJXR2WWORH6DR2V6DN2/bundle.json","state":"https://pith.science/pith/YKXUFMEWJXR2WWORH6DR2V6DN2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YKXUFMEWJXR2WWORH6DR2V6DN2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:YKXUFMEWJXR2WWORH6DR2V6DN2","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":"a92213326553a94c783cf20774d52f5134ba8122eec677cd747220eea5f50a2e","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-11-19T08:32:14Z","title_canon_sha256":"854d09057ad69be9f76d5e04fa0a03b4be13eabb4c518abda9b399f2d9faad04"},"schema_version":"1.0","source":{"id":"2411.12330","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2411.12330","created_at":"2026-07-05T09:37:19Z"},{"alias_kind":"arxiv_version","alias_value":"2411.12330v1","created_at":"2026-07-05T09:37:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.12330","created_at":"2026-07-05T09:37:19Z"},{"alias_kind":"pith_short_12","alias_value":"YKXUFMEWJXR2","created_at":"2026-07-05T09:37:19Z"},{"alias_kind":"pith_short_16","alias_value":"YKXUFMEWJXR2WWOR","created_at":"2026-07-05T09:37:19Z"},{"alias_kind":"pith_short_8","alias_value":"YKXUFMEW","created_at":"2026-07-05T09:37:19Z"}],"graph_snapshots":[{"event_id":"sha256:82eba927203f62aa91338f71c854b40bd9ac6575e61ee0ab6289e9563fc88bad","target":"graph","created_at":"2026-07-05T09:37:19Z","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/2411.12330/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Graph Neural Networks (GNNs) and their message passing framework that leverages both structural and feature information, have become a standard method for solving graph-based machine learning problems. However, these approaches still struggle to generalise well beyond datasets that exhibit strong homophily, where nodes of the same class tend to connect. This limitation has led to the development of complex neural architectures that pose challenges in terms of efficiency and scalability. In response to these limitations, we focus on simpler and more scalable approaches and introduce Graph-aware","authors_text":"Simon Delarue, Thomas Bonald, Tiphaine Viard","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-11-19T08:32:14Z","title":"Graph as a feature: improving node classification with non-neural graph-aware logistic regression"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.12330","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:b42d0d7994c8a6c962a1e548455c088825e4786f1e9fb0e8061d0009f7c791fe","target":"record","created_at":"2026-07-05T09:37:19Z","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":"a92213326553a94c783cf20774d52f5134ba8122eec677cd747220eea5f50a2e","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-11-19T08:32:14Z","title_canon_sha256":"854d09057ad69be9f76d5e04fa0a03b4be13eabb4c518abda9b399f2d9faad04"},"schema_version":"1.0","source":{"id":"2411.12330","kind":"arxiv","version":1}},"canonical_sha256":"c2af42b0964de3ab59d13f871d57c36ea4f27a2cc9574bd7cd0716039b51c475","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c2af42b0964de3ab59d13f871d57c36ea4f27a2cc9574bd7cd0716039b51c475","first_computed_at":"2026-07-05T09:37:19.681203Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:37:19.681203Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"BMwAzTk63rlE8B5t45ky5Ml0S2hEpB8fvxDWua8F0DAg4yUxSUT13L5wDpJHK/7colkXb2nurNdPGteXK6RECQ==","signature_status":"signed_v1","signed_at":"2026-07-05T09:37:19.682234Z","signed_message":"canonical_sha256_bytes"},"source_id":"2411.12330","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b42d0d7994c8a6c962a1e548455c088825e4786f1e9fb0e8061d0009f7c791fe","sha256:82eba927203f62aa91338f71c854b40bd9ac6575e61ee0ab6289e9563fc88bad"],"state_sha256":"c4be037a834332ac432734a1e87416bb37042062d9c5439eae5cea3f5221a74e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wy3c81qIhjwwjDX5og/9DkZQt0DRvx0Ur2suQV4sXJU5Zk9aVwSzbt/s+858mpLo412D+wPMOxyGot+u0rHXAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-14T12:38:16.167041Z","bundle_sha256":"dac55dc1419d694b3f55ae9bc8c5cefe914f2e9dd62f20a228c616d2f5f925e4"}}