{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:Q3OC4GSGOKCJJJWQ3F7US4KIV3","short_pith_number":"pith:Q3OC4GSG","canonical_record":{"source":{"id":"2003.02829","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-03-05T18:57:45Z","cross_cats_sorted":["cs.DB","cs.SI","stat.ML"],"title_canon_sha256":"55d8f0224d28f7267b3bb1ce1b2b392a08d7567a21a209ef731a8339fae1e833","abstract_canon_sha256":"3850e4b9dc941a877ea3df19cd020a2cfedb2dc837f91f8172b03297c98169e7"},"schema_version":"1.0"},"canonical_sha256":"86dc2e1a46728494a6d0d97f497148aeded80093a8a348374fa343d75be96af3","source":{"kind":"arxiv","id":"2003.02829","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2003.02829","created_at":"2026-07-05T00:46:00Z"},{"alias_kind":"arxiv_version","alias_value":"2003.02829v1","created_at":"2026-07-05T00:46:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2003.02829","created_at":"2026-07-05T00:46:00Z"},{"alias_kind":"pith_short_12","alias_value":"Q3OC4GSGOKCJ","created_at":"2026-07-05T00:46:00Z"},{"alias_kind":"pith_short_16","alias_value":"Q3OC4GSGOKCJJJWQ","created_at":"2026-07-05T00:46:00Z"},{"alias_kind":"pith_short_8","alias_value":"Q3OC4GSG","created_at":"2026-07-05T00:46:00Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:Q3OC4GSGOKCJJJWQ3F7US4KIV3","target":"record","payload":{"canonical_record":{"source":{"id":"2003.02829","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-03-05T18:57:45Z","cross_cats_sorted":["cs.DB","cs.SI","stat.ML"],"title_canon_sha256":"55d8f0224d28f7267b3bb1ce1b2b392a08d7567a21a209ef731a8339fae1e833","abstract_canon_sha256":"3850e4b9dc941a877ea3df19cd020a2cfedb2dc837f91f8172b03297c98169e7"},"schema_version":"1.0"},"canonical_sha256":"86dc2e1a46728494a6d0d97f497148aeded80093a8a348374fa343d75be96af3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:46:00.038393Z","signature_b64":"STkqfdEbCrSK2Iz4UZ+17sjPdyZWWzrD3m+2DhcgiTVyRXBSr8Qq8pgi9KT55lqiuBVKjQi751u27MiKeaVKBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"86dc2e1a46728494a6d0d97f497148aeded80093a8a348374fa343d75be96af3","last_reissued_at":"2026-07-05T00:46:00.037882Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:46:00.037882Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2003.02829","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-05T00:46:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Slqjtu4qp+DE7NmKW9DS7L7ioSk/56+jL9pIy5e63DgNW7CwaNKN5cbVs9x+d4ZrHbiimLRP8fEya4jKQFWXBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-01T01:00:19.592866Z"},"content_sha256":"ab578f587aa88c8a6d353b4874ac1c4f03ada3863f13209eb3b589a5837db161","schema_version":"1.0","event_id":"sha256:ab578f587aa88c8a6d353b4874ac1c4f03ada3863f13209eb3b589a5837db161"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:Q3OC4GSGOKCJJJWQ3F7US4KIV3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Factorized Graph Representations for Semi-Supervised Learning from Sparse Data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DB","cs.SI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Krishna Kumar P., Paul Langton, Wolfgang Gatterbauer","submitted_at":"2020-03-05T18:57:45Z","abstract_excerpt":"Node classification is an important problem in graph data management. It is commonly solved by various label propagation methods that work iteratively starting from a few labeled seed nodes. For graphs with arbitrary compatibilities between classes, these methods crucially depend on knowing the compatibility matrix that must be provided by either domain experts or heuristics. Can we instead directly estimate the correct compatibilities from a sparsely labeled graph in a principled and scalable way? We answer this question affirmatively and suggest a method called distant compatibility estimati"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2003.02829","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/2003.02829/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-05T00:46:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3BygsWGPl1QPnWpZWKY3wHEVdyvsd6sQr4HbVQfWzNesDIB+OOX/9Fyg9lm8fKqweoypdaeMCW+Or0GCy5LECQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-01T01:00:19.593194Z"},"content_sha256":"2a94c884f700eb10be68adbea20a1acbc4b5d72eea6547705e205d909f15d305","schema_version":"1.0","event_id":"sha256:2a94c884f700eb10be68adbea20a1acbc4b5d72eea6547705e205d909f15d305"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Q3OC4GSGOKCJJJWQ3F7US4KIV3/bundle.json","state_url":"https://pith.science/pith/Q3OC4GSGOKCJJJWQ3F7US4KIV3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Q3OC4GSGOKCJJJWQ3F7US4KIV3/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-01T01:00:19Z","links":{"resolver":"https://pith.science/pith/Q3OC4GSGOKCJJJWQ3F7US4KIV3","bundle":"https://pith.science/pith/Q3OC4GSGOKCJJJWQ3F7US4KIV3/bundle.json","state":"https://pith.science/pith/Q3OC4GSGOKCJJJWQ3F7US4KIV3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Q3OC4GSGOKCJJJWQ3F7US4KIV3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:Q3OC4GSGOKCJJJWQ3F7US4KIV3","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":"3850e4b9dc941a877ea3df19cd020a2cfedb2dc837f91f8172b03297c98169e7","cross_cats_sorted":["cs.DB","cs.SI","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-03-05T18:57:45Z","title_canon_sha256":"55d8f0224d28f7267b3bb1ce1b2b392a08d7567a21a209ef731a8339fae1e833"},"schema_version":"1.0","source":{"id":"2003.02829","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2003.02829","created_at":"2026-07-05T00:46:00Z"},{"alias_kind":"arxiv_version","alias_value":"2003.02829v1","created_at":"2026-07-05T00:46:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2003.02829","created_at":"2026-07-05T00:46:00Z"},{"alias_kind":"pith_short_12","alias_value":"Q3OC4GSGOKCJ","created_at":"2026-07-05T00:46:00Z"},{"alias_kind":"pith_short_16","alias_value":"Q3OC4GSGOKCJJJWQ","created_at":"2026-07-05T00:46:00Z"},{"alias_kind":"pith_short_8","alias_value":"Q3OC4GSG","created_at":"2026-07-05T00:46:00Z"}],"graph_snapshots":[{"event_id":"sha256:2a94c884f700eb10be68adbea20a1acbc4b5d72eea6547705e205d909f15d305","target":"graph","created_at":"2026-07-05T00:46:00Z","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/2003.02829/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Node classification is an important problem in graph data management. It is commonly solved by various label propagation methods that work iteratively starting from a few labeled seed nodes. For graphs with arbitrary compatibilities between classes, these methods crucially depend on knowing the compatibility matrix that must be provided by either domain experts or heuristics. Can we instead directly estimate the correct compatibilities from a sparsely labeled graph in a principled and scalable way? We answer this question affirmatively and suggest a method called distant compatibility estimati","authors_text":"Krishna Kumar P., Paul Langton, Wolfgang Gatterbauer","cross_cats":["cs.DB","cs.SI","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-03-05T18:57:45Z","title":"Factorized Graph Representations for Semi-Supervised Learning from Sparse Data"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2003.02829","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:ab578f587aa88c8a6d353b4874ac1c4f03ada3863f13209eb3b589a5837db161","target":"record","created_at":"2026-07-05T00:46:00Z","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":"3850e4b9dc941a877ea3df19cd020a2cfedb2dc837f91f8172b03297c98169e7","cross_cats_sorted":["cs.DB","cs.SI","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-03-05T18:57:45Z","title_canon_sha256":"55d8f0224d28f7267b3bb1ce1b2b392a08d7567a21a209ef731a8339fae1e833"},"schema_version":"1.0","source":{"id":"2003.02829","kind":"arxiv","version":1}},"canonical_sha256":"86dc2e1a46728494a6d0d97f497148aeded80093a8a348374fa343d75be96af3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"86dc2e1a46728494a6d0d97f497148aeded80093a8a348374fa343d75be96af3","first_computed_at":"2026-07-05T00:46:00.037882Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:46:00.037882Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"STkqfdEbCrSK2Iz4UZ+17sjPdyZWWzrD3m+2DhcgiTVyRXBSr8Qq8pgi9KT55lqiuBVKjQi751u27MiKeaVKBw==","signature_status":"signed_v1","signed_at":"2026-07-05T00:46:00.038393Z","signed_message":"canonical_sha256_bytes"},"source_id":"2003.02829","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ab578f587aa88c8a6d353b4874ac1c4f03ada3863f13209eb3b589a5837db161","sha256:2a94c884f700eb10be68adbea20a1acbc4b5d72eea6547705e205d909f15d305"],"state_sha256":"3dfae74131de82e36f7517d650c8fdafafe2ca434689caec3b481a08402674e3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hzkFX51eWu2HuYH/hOS49JGsFlaip/rMI0QrgDy4zQMaEA6UvCzupJpPmqeFSnaYvqTJyiP1u3ijkrc19Z11BA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-01T01:00:19.597463Z","bundle_sha256":"bea40b387cf1199a4979e1d77fb4a8f6473098ec3afba9af640a59eba31648ee"}}