{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:UNL262PFVXRLJBL4DEHN27KQLG","short_pith_number":"pith:UNL262PF","schema_version":"1.0","canonical_sha256":"a357af69e5ade2b4857c190edd7d5059b16c07672b83fe7348f3c35468afdbfd","source":{"kind":"arxiv","id":"2006.09022","version":1},"attestation_state":"computed","paper":{"title":"NodeNet: A Graph Regularised Neural Network for Node Classification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.AP"],"primary_cat":"cs.SI","authors_text":"Manojkumar Parmar, Shrey Dabhi","submitted_at":"2020-06-16T09:41:58Z","abstract_excerpt":"Real-world events exhibit a high degree of interdependence and connections, and hence data points generated also inherit the linkages. However, the majority of AI/ML techniques leave out the linkages among data points. The recent surge of interest in graph-based AI/ML techniques is aimed to leverage the linkages. Graph-based learning algorithms utilize the data and related information effectively to build superior models. Neural Graph Learning (NGL) is one such technique that utilizes a traditional machine learning algorithm with a modified loss function to leverage the edges in the graph stru"},"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":"2006.09022","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2020-06-16T09:41:58Z","cross_cats_sorted":["cs.LG","stat.AP"],"title_canon_sha256":"629833fbca62a006e4d91de8507054b3e288358fced250090731002d7ea8d8ac","abstract_canon_sha256":"542bd114f26b6720c7b2831370378b21ad1efea67f686e22a6dc9c4a15fc976d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:10:45.702062Z","signature_b64":"LktcnKPN0as5u9WPOoA6kxdM9S1hwF2i9UPkwx4k5U2E2H/isrHS7DEwESaFFHCKo8Py4zLYxxAPID6EJXwcAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a357af69e5ade2b4857c190edd7d5059b16c07672b83fe7348f3c35468afdbfd","last_reissued_at":"2026-07-05T01:10:45.701613Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:10:45.701613Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"NodeNet: A Graph Regularised Neural Network for Node Classification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.AP"],"primary_cat":"cs.SI","authors_text":"Manojkumar Parmar, Shrey Dabhi","submitted_at":"2020-06-16T09:41:58Z","abstract_excerpt":"Real-world events exhibit a high degree of interdependence and connections, and hence data points generated also inherit the linkages. However, the majority of AI/ML techniques leave out the linkages among data points. The recent surge of interest in graph-based AI/ML techniques is aimed to leverage the linkages. Graph-based learning algorithms utilize the data and related information effectively to build superior models. Neural Graph Learning (NGL) is one such technique that utilizes a traditional machine learning algorithm with a modified loss function to leverage the edges in the graph stru"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2006.09022","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/2006.09022/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":"2006.09022","created_at":"2026-07-05T01:10:45.701673+00:00"},{"alias_kind":"arxiv_version","alias_value":"2006.09022v1","created_at":"2026-07-05T01:10:45.701673+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2006.09022","created_at":"2026-07-05T01:10:45.701673+00:00"},{"alias_kind":"pith_short_12","alias_value":"UNL262PFVXRL","created_at":"2026-07-05T01:10:45.701673+00:00"},{"alias_kind":"pith_short_16","alias_value":"UNL262PFVXRLJBL4","created_at":"2026-07-05T01:10:45.701673+00:00"},{"alias_kind":"pith_short_8","alias_value":"UNL262PF","created_at":"2026-07-05T01:10:45.701673+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/UNL262PFVXRLJBL4DEHN27KQLG","json":"https://pith.science/pith/UNL262PFVXRLJBL4DEHN27KQLG.json","graph_json":"https://pith.science/api/pith-number/UNL262PFVXRLJBL4DEHN27KQLG/graph.json","events_json":"https://pith.science/api/pith-number/UNL262PFVXRLJBL4DEHN27KQLG/events.json","paper":"https://pith.science/paper/UNL262PF"},"agent_actions":{"view_html":"https://pith.science/pith/UNL262PFVXRLJBL4DEHN27KQLG","download_json":"https://pith.science/pith/UNL262PFVXRLJBL4DEHN27KQLG.json","view_paper":"https://pith.science/paper/UNL262PF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2006.09022&json=true","fetch_graph":"https://pith.science/api/pith-number/UNL262PFVXRLJBL4DEHN27KQLG/graph.json","fetch_events":"https://pith.science/api/pith-number/UNL262PFVXRLJBL4DEHN27KQLG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UNL262PFVXRLJBL4DEHN27KQLG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UNL262PFVXRLJBL4DEHN27KQLG/action/storage_attestation","attest_author":"https://pith.science/pith/UNL262PFVXRLJBL4DEHN27KQLG/action/author_attestation","sign_citation":"https://pith.science/pith/UNL262PFVXRLJBL4DEHN27KQLG/action/citation_signature","submit_replication":"https://pith.science/pith/UNL262PFVXRLJBL4DEHN27KQLG/action/replication_record"}},"created_at":"2026-07-05T01:10:45.701673+00:00","updated_at":"2026-07-05T01:10:45.701673+00:00"}