{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:455MGLEHQQ5RSG3PWMSDU6UYCR","short_pith_number":"pith:455MGLEH","schema_version":"1.0","canonical_sha256":"e77ac32c87843b191b6fb3243a7a98147d496cae92c0aa1b8e152b0bc05f48f0","source":{"kind":"arxiv","id":"2605.24367","version":1},"attestation_state":"computed","paper":{"title":"Gaussian Rank-Based Neighborhood Degree for Graph Neural Networks in Image Classification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.CV","authors_text":"Jean Roberto Ponciano, Lucas Pascotti Valem, Rafael Mendon\\c{c}a Duarte","submitted_at":"2026-05-23T03:07:56Z","abstract_excerpt":"The exponential growth of data has intensified the gap between the availability of unlabeled data and the high cost of manual annotation. Graph Neural Networks (GNNs) have emerged as a promising solution, as they exploit relational structures and learn from both labeled and unlabeled data, performing semi-supervised learning. A crucial component of many of these models is degree-based normalization, which influences message propagation but typically assumes uniform importance among neighboring nodes. In image classification, graphs are usually constructed from feature similarity, where treatin"},"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":"2605.24367","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2026-05-23T03:07:56Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"5f2c3c708e1a54b5e35be817ee68a9c76f9da8b0f67865a9749122bcdd153513","abstract_canon_sha256":"abf4a6cb066eabd874ea07483a2556e834c5ccea6b502a04bc98db19bdcd3541"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-26T01:03:02.110800Z","signature_b64":"8a2aqJ9peaSSYaDMUlNBjFBWcTlfyVP19MQOxcP8g0Y7Rsgb5f+1W4gVUqSg2vYTEvaJ06KW0xGArJ/rXQj/Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e77ac32c87843b191b6fb3243a7a98147d496cae92c0aa1b8e152b0bc05f48f0","last_reissued_at":"2026-05-26T01:03:02.109961Z","signature_status":"signed_v1","first_computed_at":"2026-05-26T01:03:02.109961Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Gaussian Rank-Based Neighborhood Degree for Graph Neural Networks in Image Classification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.CV","authors_text":"Jean Roberto Ponciano, Lucas Pascotti Valem, Rafael Mendon\\c{c}a Duarte","submitted_at":"2026-05-23T03:07:56Z","abstract_excerpt":"The exponential growth of data has intensified the gap between the availability of unlabeled data and the high cost of manual annotation. Graph Neural Networks (GNNs) have emerged as a promising solution, as they exploit relational structures and learn from both labeled and unlabeled data, performing semi-supervised learning. A crucial component of many of these models is degree-based normalization, which influences message propagation but typically assumes uniform importance among neighboring nodes. In image classification, graphs are usually constructed from feature similarity, where treatin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.24367","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/2605.24367/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":"2605.24367","created_at":"2026-05-26T01:03:02.110084+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.24367v1","created_at":"2026-05-26T01:03:02.110084+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.24367","created_at":"2026-05-26T01:03:02.110084+00:00"},{"alias_kind":"pith_short_12","alias_value":"455MGLEHQQ5R","created_at":"2026-05-26T01:03:02.110084+00:00"},{"alias_kind":"pith_short_16","alias_value":"455MGLEHQQ5RSG3P","created_at":"2026-05-26T01:03:02.110084+00:00"},{"alias_kind":"pith_short_8","alias_value":"455MGLEH","created_at":"2026-05-26T01:03:02.110084+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/455MGLEHQQ5RSG3PWMSDU6UYCR","json":"https://pith.science/pith/455MGLEHQQ5RSG3PWMSDU6UYCR.json","graph_json":"https://pith.science/api/pith-number/455MGLEHQQ5RSG3PWMSDU6UYCR/graph.json","events_json":"https://pith.science/api/pith-number/455MGLEHQQ5RSG3PWMSDU6UYCR/events.json","paper":"https://pith.science/paper/455MGLEH"},"agent_actions":{"view_html":"https://pith.science/pith/455MGLEHQQ5RSG3PWMSDU6UYCR","download_json":"https://pith.science/pith/455MGLEHQQ5RSG3PWMSDU6UYCR.json","view_paper":"https://pith.science/paper/455MGLEH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.24367&json=true","fetch_graph":"https://pith.science/api/pith-number/455MGLEHQQ5RSG3PWMSDU6UYCR/graph.json","fetch_events":"https://pith.science/api/pith-number/455MGLEHQQ5RSG3PWMSDU6UYCR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/455MGLEHQQ5RSG3PWMSDU6UYCR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/455MGLEHQQ5RSG3PWMSDU6UYCR/action/storage_attestation","attest_author":"https://pith.science/pith/455MGLEHQQ5RSG3PWMSDU6UYCR/action/author_attestation","sign_citation":"https://pith.science/pith/455MGLEHQQ5RSG3PWMSDU6UYCR/action/citation_signature","submit_replication":"https://pith.science/pith/455MGLEHQQ5RSG3PWMSDU6UYCR/action/replication_record"}},"created_at":"2026-05-26T01:03:02.110084+00:00","updated_at":"2026-05-26T01:03:02.110084+00:00"}