{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:FQRXC3CK6SXPLR4AKNN6ZQR45L","short_pith_number":"pith:FQRXC3CK","schema_version":"1.0","canonical_sha256":"2c23716c4af4aef5c780535becc23ceacd8c1698815dcd54e88d18cb4a781404","source":{"kind":"arxiv","id":"2310.10114","version":3},"attestation_state":"computed","paper":{"title":"Node classification in networks via simplicial interactions","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["stat.CO"],"primary_cat":"cs.SI","authors_text":"Eunho Koo, Tongseok Lim","submitted_at":"2023-10-16T06:48:17Z","abstract_excerpt":"In the node classification task, it is natural to presume that densely connected nodes tend to exhibit similar attributes. Given this, it is crucial to first define what constitutes a dense connection and to develop a reliable mathematical tool for assessing node cohesiveness. In this paper, we propose a probability-based objective function for semi-supervised node classification that takes advantage of higher-order networks' capabilities. The proposed function reflects the philosophy aligned with the intuition behind classifying within higher order networks, as it is designed to reduce the li"},"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":"2310.10114","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.SI","submitted_at":"2023-10-16T06:48:17Z","cross_cats_sorted":["stat.CO"],"title_canon_sha256":"86e24ffc53b3c1fe6cf45610bc67010181271dcfca331b59c4f378ba7989eee8","abstract_canon_sha256":"5f4173e7702e2e45e1274f4840595e2b306bb144dd5a631bb5fcce8bf70c44eb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:55:53.079732Z","signature_b64":"lf2iskp7uXYtViNmtcTWINAHkF6OCLbSQKsl5KpdSiYAmZ0DjDNU59c4B1AObB6FUzsgb9hwyTiUgnfAkx5RAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2c23716c4af4aef5c780535becc23ceacd8c1698815dcd54e88d18cb4a781404","last_reissued_at":"2026-07-05T09:55:53.079288Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:55:53.079288Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Node classification in networks via simplicial interactions","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["stat.CO"],"primary_cat":"cs.SI","authors_text":"Eunho Koo, Tongseok Lim","submitted_at":"2023-10-16T06:48:17Z","abstract_excerpt":"In the node classification task, it is natural to presume that densely connected nodes tend to exhibit similar attributes. Given this, it is crucial to first define what constitutes a dense connection and to develop a reliable mathematical tool for assessing node cohesiveness. In this paper, we propose a probability-based objective function for semi-supervised node classification that takes advantage of higher-order networks' capabilities. The proposed function reflects the philosophy aligned with the intuition behind classifying within higher order networks, as it is designed to reduce the li"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2310.10114","kind":"arxiv","version":3},"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/2310.10114/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":"2310.10114","created_at":"2026-07-05T09:55:53.079345+00:00"},{"alias_kind":"arxiv_version","alias_value":"2310.10114v3","created_at":"2026-07-05T09:55:53.079345+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2310.10114","created_at":"2026-07-05T09:55:53.079345+00:00"},{"alias_kind":"pith_short_12","alias_value":"FQRXC3CK6SXP","created_at":"2026-07-05T09:55:53.079345+00:00"},{"alias_kind":"pith_short_16","alias_value":"FQRXC3CK6SXPLR4A","created_at":"2026-07-05T09:55:53.079345+00:00"},{"alias_kind":"pith_short_8","alias_value":"FQRXC3CK","created_at":"2026-07-05T09:55:53.079345+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/FQRXC3CK6SXPLR4AKNN6ZQR45L","json":"https://pith.science/pith/FQRXC3CK6SXPLR4AKNN6ZQR45L.json","graph_json":"https://pith.science/api/pith-number/FQRXC3CK6SXPLR4AKNN6ZQR45L/graph.json","events_json":"https://pith.science/api/pith-number/FQRXC3CK6SXPLR4AKNN6ZQR45L/events.json","paper":"https://pith.science/paper/FQRXC3CK"},"agent_actions":{"view_html":"https://pith.science/pith/FQRXC3CK6SXPLR4AKNN6ZQR45L","download_json":"https://pith.science/pith/FQRXC3CK6SXPLR4AKNN6ZQR45L.json","view_paper":"https://pith.science/paper/FQRXC3CK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2310.10114&json=true","fetch_graph":"https://pith.science/api/pith-number/FQRXC3CK6SXPLR4AKNN6ZQR45L/graph.json","fetch_events":"https://pith.science/api/pith-number/FQRXC3CK6SXPLR4AKNN6ZQR45L/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FQRXC3CK6SXPLR4AKNN6ZQR45L/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FQRXC3CK6SXPLR4AKNN6ZQR45L/action/storage_attestation","attest_author":"https://pith.science/pith/FQRXC3CK6SXPLR4AKNN6ZQR45L/action/author_attestation","sign_citation":"https://pith.science/pith/FQRXC3CK6SXPLR4AKNN6ZQR45L/action/citation_signature","submit_replication":"https://pith.science/pith/FQRXC3CK6SXPLR4AKNN6ZQR45L/action/replication_record"}},"created_at":"2026-07-05T09:55:53.079345+00:00","updated_at":"2026-07-05T09:55:53.079345+00:00"}