{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:HMSZDGKRXASZEFXXHEIOYREPFP","short_pith_number":"pith:HMSZDGKR","schema_version":"1.0","canonical_sha256":"3b25919951b8259216f73910ec448f2bcc352fe29c398844f7c4c7a8ceb9df9c","source":{"kind":"arxiv","id":"1903.06007","version":1},"attestation_state":"computed","paper":{"title":"$L^\\gamma$-PageRank for Semi-Supervised Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","eess.SP","stat.ML"],"primary_cat":"cs.SI","authors_text":"Esteban Bautista, Patrice Abry, Paulo Gon\\c{c}alves","submitted_at":"2019-03-11T16:31:37Z","abstract_excerpt":"PageRank for Semi-Supervised Learning has shown to leverage data structures and limited tagged examples to yield meaningful classification. Despite successes, classification performance can still be improved, particularly in cases of fuzzy graphs or unbalanced labeled data. To address such limitations, a novel approach based on powers of the Laplacian matrix $L^\\gamma$ ($\\gamma > 0$), referred to as $L^\\gamma$-PageRank, is proposed. Its theoretical study shows that it operates on signed graphs, where nodes belonging to one same class are more likely to share positive edges while nodes from dif"},"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":"1903.06007","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2019-03-11T16:31:37Z","cross_cats_sorted":["cs.LG","eess.SP","stat.ML"],"title_canon_sha256":"7149ec494030addca77a9795eb9db2b7bc33d5b642a15299b266b15be1f595ca","abstract_canon_sha256":"7433a15291d14bd167b1db92d5b0472514b5d2036a2349620006531650000953"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:51:15.584542Z","signature_b64":"wbpzExd7uJQs4wmLwHHN1L0xUKcs3EEfBOOnj52V3JNU75QdIKykzSD33mUI3hHlVWjpJfIkqQMSByq5FcQsAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3b25919951b8259216f73910ec448f2bcc352fe29c398844f7c4c7a8ceb9df9c","last_reissued_at":"2026-05-17T23:51:15.584065Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:51:15.584065Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"$L^\\gamma$-PageRank for Semi-Supervised Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","eess.SP","stat.ML"],"primary_cat":"cs.SI","authors_text":"Esteban Bautista, Patrice Abry, Paulo Gon\\c{c}alves","submitted_at":"2019-03-11T16:31:37Z","abstract_excerpt":"PageRank for Semi-Supervised Learning has shown to leverage data structures and limited tagged examples to yield meaningful classification. Despite successes, classification performance can still be improved, particularly in cases of fuzzy graphs or unbalanced labeled data. To address such limitations, a novel approach based on powers of the Laplacian matrix $L^\\gamma$ ($\\gamma > 0$), referred to as $L^\\gamma$-PageRank, is proposed. Its theoretical study shows that it operates on signed graphs, where nodes belonging to one same class are more likely to share positive edges while nodes from dif"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.06007","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":""},"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":"1903.06007","created_at":"2026-05-17T23:51:15.584120+00:00"},{"alias_kind":"arxiv_version","alias_value":"1903.06007v1","created_at":"2026-05-17T23:51:15.584120+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.06007","created_at":"2026-05-17T23:51:15.584120+00:00"},{"alias_kind":"pith_short_12","alias_value":"HMSZDGKRXASZ","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_16","alias_value":"HMSZDGKRXASZEFXX","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_8","alias_value":"HMSZDGKR","created_at":"2026-05-18T12:33:18.533446+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/HMSZDGKRXASZEFXXHEIOYREPFP","json":"https://pith.science/pith/HMSZDGKRXASZEFXXHEIOYREPFP.json","graph_json":"https://pith.science/api/pith-number/HMSZDGKRXASZEFXXHEIOYREPFP/graph.json","events_json":"https://pith.science/api/pith-number/HMSZDGKRXASZEFXXHEIOYREPFP/events.json","paper":"https://pith.science/paper/HMSZDGKR"},"agent_actions":{"view_html":"https://pith.science/pith/HMSZDGKRXASZEFXXHEIOYREPFP","download_json":"https://pith.science/pith/HMSZDGKRXASZEFXXHEIOYREPFP.json","view_paper":"https://pith.science/paper/HMSZDGKR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1903.06007&json=true","fetch_graph":"https://pith.science/api/pith-number/HMSZDGKRXASZEFXXHEIOYREPFP/graph.json","fetch_events":"https://pith.science/api/pith-number/HMSZDGKRXASZEFXXHEIOYREPFP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HMSZDGKRXASZEFXXHEIOYREPFP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HMSZDGKRXASZEFXXHEIOYREPFP/action/storage_attestation","attest_author":"https://pith.science/pith/HMSZDGKRXASZEFXXHEIOYREPFP/action/author_attestation","sign_citation":"https://pith.science/pith/HMSZDGKRXASZEFXXHEIOYREPFP/action/citation_signature","submit_replication":"https://pith.science/pith/HMSZDGKRXASZEFXXHEIOYREPFP/action/replication_record"}},"created_at":"2026-05-17T23:51:15.584120+00:00","updated_at":"2026-05-17T23:51:15.584120+00:00"}