{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:OWPCVVMCJ3T56WSN7SMFJWCYBT","short_pith_number":"pith:OWPCVVMC","canonical_record":{"source":{"id":"2010.04558","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-10-09T13:28:06Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"f73e03f948d3203a1892b5cc9f0e386bb9cd4580ace2c683426e3fc103d20b44","abstract_canon_sha256":"b05e9cf833b460e787833e4b9883f8cace3f92369fe638a750950990caa34ea5"},"schema_version":"1.0"},"canonical_sha256":"759e2ad5824ee7df5a4dfc9854d8580ce1a08164a9fa24d5b4e6aae397e4800c","source":{"kind":"arxiv","id":"2010.04558","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2010.04558","created_at":"2026-07-05T01:41:39Z"},{"alias_kind":"arxiv_version","alias_value":"2010.04558v1","created_at":"2026-07-05T01:41:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2010.04558","created_at":"2026-07-05T01:41:39Z"},{"alias_kind":"pith_short_12","alias_value":"OWPCVVMCJ3T5","created_at":"2026-07-05T01:41:39Z"},{"alias_kind":"pith_short_16","alias_value":"OWPCVVMCJ3T56WSN","created_at":"2026-07-05T01:41:39Z"},{"alias_kind":"pith_short_8","alias_value":"OWPCVVMC","created_at":"2026-07-05T01:41:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:OWPCVVMCJ3T56WSN7SMFJWCYBT","target":"record","payload":{"canonical_record":{"source":{"id":"2010.04558","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-10-09T13:28:06Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"f73e03f948d3203a1892b5cc9f0e386bb9cd4580ace2c683426e3fc103d20b44","abstract_canon_sha256":"b05e9cf833b460e787833e4b9883f8cace3f92369fe638a750950990caa34ea5"},"schema_version":"1.0"},"canonical_sha256":"759e2ad5824ee7df5a4dfc9854d8580ce1a08164a9fa24d5b4e6aae397e4800c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:41:39.559347Z","signature_b64":"BsXCBLg3QA27yzD8Kptfg6ExXpyXSSXf0Q6lzctNtvDILF11GAkHI4HzESJ9y9wTMpmODO5yuqIw4qzM0zcZCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"759e2ad5824ee7df5a4dfc9854d8580ce1a08164a9fa24d5b4e6aae397e4800c","last_reissued_at":"2026-07-05T01:41:39.558844Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:41:39.558844Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2010.04558","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-05T01:41:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"trHKjXqZxe+c8THmxuGOdoi00PSx0kNwrll05NN94/kiJ18Cw923G55Va+SCmXQLVrY5NaUY/+DTJ/lqiwuNBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T12:40:41.071083Z"},"content_sha256":"3190711e06ef64feb80b15db51dd2a58180c030f15ac78a3fd5bf922ea40880a","schema_version":"1.0","event_id":"sha256:3190711e06ef64feb80b15db51dd2a58180c030f15ac78a3fd5bf922ea40880a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:OWPCVVMCJ3T56WSN7SMFJWCYBT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"HyperSAGE: Generalizing Inductive Representation Learning on Hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Deepak K. Gupta, Devanshu Arya, Marcel Worring, Stevan Rudinac","submitted_at":"2020-10-09T13:28:06Z","abstract_excerpt":"Graphs are the most ubiquitous form of structured data representation used in machine learning. They model, however, only pairwise relations between nodes and are not designed for encoding the higher-order relations found in many real-world datasets. To model such complex relations, hypergraphs have proven to be a natural representation. Learning the node representations in a hypergraph is more complex than in a graph as it involves information propagation at two levels: within every hyperedge and across the hyperedges. Most current approaches first transform a hypergraph structure to a graph "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2010.04558","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/2010.04558/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-05T01:41:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CfIa2Q1GsrMKfFNw8TxJnvU+jUkIaInFoGX0GvOJoySo90B4uuFnllglM9P9yZkFjwDa1KpA8OUfhUQjS1r6BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T12:40:41.071654Z"},"content_sha256":"0c7812c57ef29bb1b33ea446ea35b74442af627927f8dd8a493dbe9e09a66fa3","schema_version":"1.0","event_id":"sha256:0c7812c57ef29bb1b33ea446ea35b74442af627927f8dd8a493dbe9e09a66fa3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OWPCVVMCJ3T56WSN7SMFJWCYBT/bundle.json","state_url":"https://pith.science/pith/OWPCVVMCJ3T56WSN7SMFJWCYBT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OWPCVVMCJ3T56WSN7SMFJWCYBT/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-09T12:40:41Z","links":{"resolver":"https://pith.science/pith/OWPCVVMCJ3T56WSN7SMFJWCYBT","bundle":"https://pith.science/pith/OWPCVVMCJ3T56WSN7SMFJWCYBT/bundle.json","state":"https://pith.science/pith/OWPCVVMCJ3T56WSN7SMFJWCYBT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OWPCVVMCJ3T56WSN7SMFJWCYBT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:OWPCVVMCJ3T56WSN7SMFJWCYBT","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":"b05e9cf833b460e787833e4b9883f8cace3f92369fe638a750950990caa34ea5","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-10-09T13:28:06Z","title_canon_sha256":"f73e03f948d3203a1892b5cc9f0e386bb9cd4580ace2c683426e3fc103d20b44"},"schema_version":"1.0","source":{"id":"2010.04558","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2010.04558","created_at":"2026-07-05T01:41:39Z"},{"alias_kind":"arxiv_version","alias_value":"2010.04558v1","created_at":"2026-07-05T01:41:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2010.04558","created_at":"2026-07-05T01:41:39Z"},{"alias_kind":"pith_short_12","alias_value":"OWPCVVMCJ3T5","created_at":"2026-07-05T01:41:39Z"},{"alias_kind":"pith_short_16","alias_value":"OWPCVVMCJ3T56WSN","created_at":"2026-07-05T01:41:39Z"},{"alias_kind":"pith_short_8","alias_value":"OWPCVVMC","created_at":"2026-07-05T01:41:39Z"}],"graph_snapshots":[{"event_id":"sha256:0c7812c57ef29bb1b33ea446ea35b74442af627927f8dd8a493dbe9e09a66fa3","target":"graph","created_at":"2026-07-05T01:41:39Z","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/2010.04558/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Graphs are the most ubiquitous form of structured data representation used in machine learning. They model, however, only pairwise relations between nodes and are not designed for encoding the higher-order relations found in many real-world datasets. To model such complex relations, hypergraphs have proven to be a natural representation. Learning the node representations in a hypergraph is more complex than in a graph as it involves information propagation at two levels: within every hyperedge and across the hyperedges. Most current approaches first transform a hypergraph structure to a graph ","authors_text":"Deepak K. Gupta, Devanshu Arya, Marcel Worring, Stevan Rudinac","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-10-09T13:28:06Z","title":"HyperSAGE: Generalizing Inductive Representation Learning on Hypergraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2010.04558","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:3190711e06ef64feb80b15db51dd2a58180c030f15ac78a3fd5bf922ea40880a","target":"record","created_at":"2026-07-05T01:41:39Z","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":"b05e9cf833b460e787833e4b9883f8cace3f92369fe638a750950990caa34ea5","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-10-09T13:28:06Z","title_canon_sha256":"f73e03f948d3203a1892b5cc9f0e386bb9cd4580ace2c683426e3fc103d20b44"},"schema_version":"1.0","source":{"id":"2010.04558","kind":"arxiv","version":1}},"canonical_sha256":"759e2ad5824ee7df5a4dfc9854d8580ce1a08164a9fa24d5b4e6aae397e4800c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"759e2ad5824ee7df5a4dfc9854d8580ce1a08164a9fa24d5b4e6aae397e4800c","first_computed_at":"2026-07-05T01:41:39.558844Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:41:39.558844Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"BsXCBLg3QA27yzD8Kptfg6ExXpyXSSXf0Q6lzctNtvDILF11GAkHI4HzESJ9y9wTMpmODO5yuqIw4qzM0zcZCQ==","signature_status":"signed_v1","signed_at":"2026-07-05T01:41:39.559347Z","signed_message":"canonical_sha256_bytes"},"source_id":"2010.04558","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3190711e06ef64feb80b15db51dd2a58180c030f15ac78a3fd5bf922ea40880a","sha256:0c7812c57ef29bb1b33ea446ea35b74442af627927f8dd8a493dbe9e09a66fa3"],"state_sha256":"9fc1e6d7c9dac6f16c71bdd9154815b57a834242e26729611e0f83f16a8854e1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"j5AH8W4THHjApn+LVuzK/KV62tzTBKU2SUKBIs2trspe4bAxhLWhaF/paAoz9URqNCZkTcVN63IVgiGJxDrEAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-09T12:40:41.076876Z","bundle_sha256":"6ff7316edf910df49f608f9dafd6a39901123fb4c918b76b07fd3fb1b064e351"}}