{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:N7CQCDD6MYZZBM2EQ5K3NF7PJX","short_pith_number":"pith:N7CQCDD6","canonical_record":{"source":{"id":"2201.12165","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-01-28T14:58:53Z","cross_cats_sorted":[],"title_canon_sha256":"40425f59706ce3c5c9033eb69451422d1ac08b1500a9225d4976855080ae8394","abstract_canon_sha256":"8f9ed19894cd3694eca71fbabc87935ec96bd97a432015f974137d086eff5665"},"schema_version":"1.0"},"canonical_sha256":"6fc5010c7e663390b3448755b697ef4df86eb8586895d5aeb5b7bf567e3faf31","source":{"kind":"arxiv","id":"2201.12165","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2201.12165","created_at":"2026-07-05T04:38:47Z"},{"alias_kind":"arxiv_version","alias_value":"2201.12165v3","created_at":"2026-07-05T04:38:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2201.12165","created_at":"2026-07-05T04:38:47Z"},{"alias_kind":"pith_short_12","alias_value":"N7CQCDD6MYZZ","created_at":"2026-07-05T04:38:47Z"},{"alias_kind":"pith_short_16","alias_value":"N7CQCDD6MYZZBM2E","created_at":"2026-07-05T04:38:47Z"},{"alias_kind":"pith_short_8","alias_value":"N7CQCDD6","created_at":"2026-07-05T04:38:47Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:N7CQCDD6MYZZBM2EQ5K3NF7PJX","target":"record","payload":{"canonical_record":{"source":{"id":"2201.12165","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-01-28T14:58:53Z","cross_cats_sorted":[],"title_canon_sha256":"40425f59706ce3c5c9033eb69451422d1ac08b1500a9225d4976855080ae8394","abstract_canon_sha256":"8f9ed19894cd3694eca71fbabc87935ec96bd97a432015f974137d086eff5665"},"schema_version":"1.0"},"canonical_sha256":"6fc5010c7e663390b3448755b697ef4df86eb8586895d5aeb5b7bf567e3faf31","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:38:47.436054Z","signature_b64":"fVgpWHOjn+BIp5uMDThQDKzGv+yBMN/EtcO4ZqwA9ov9YUUz8izvPpML7HUmBbHb5nG63St9D+GN/vIngCc0BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6fc5010c7e663390b3448755b697ef4df86eb8586895d5aeb5b7bf567e3faf31","last_reissued_at":"2026-07-05T04:38:47.435663Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:38:47.435663Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2201.12165","source_version":3,"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-05T04:38:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KasviaLEIiVNM3sDgqCprrcxyqGEFpCfYTI58L9a+agxdwS2jKuH4ThDS5j/JHw49djwpGdWz0v34zyu1u0UBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T03:16:01.254959Z"},"content_sha256":"0882ecdf198952e9c5937f52712985626792d3ec48594ac701bf58ba9d40d829","schema_version":"1.0","event_id":"sha256:0882ecdf198952e9c5937f52712985626792d3ec48594ac701bf58ba9d40d829"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:N7CQCDD6MYZZBM2EQ5K3NF7PJX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"ReGAE: Graph autoencoder based on recursive neural networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Adam Ma{\\l}kowski, Jakub Grzechoci\\'nski, Pawe{\\l} Wawrzy\\'nski","submitted_at":"2022-01-28T14:58:53Z","abstract_excerpt":"Invertible transformation of large graphs into fixed dimensional vectors (embeddings) remains a challenge. Its overcoming would reduce any operation on graphs to an operation in a vector space. However, most existing methods are limited to graphs with tens of vertices. In this paper we address the above challenge with recursive neural networks - the encoder and the decoder. The encoder network transforms embeddings of subgraphs into embeddings of larger subgraphs, and eventually into the embedding of the input graph. The decoder does the opposite. The dimension of the embeddings is constant re"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2201.12165","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/2201.12165/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-05T04:38:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Qd152MNacJVxGCKrElz5hX2fk4A3PUNpOjL7eeY0ffxXC09v4iO//IGZ2yC5FHq3W5iW9xTgUGdU+F2kjgIzAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T03:16:01.255465Z"},"content_sha256":"e81036022744ae44eb7aa0a3cafb725f667d2779635b38158fc5734202dc4ed9","schema_version":"1.0","event_id":"sha256:e81036022744ae44eb7aa0a3cafb725f667d2779635b38158fc5734202dc4ed9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/N7CQCDD6MYZZBM2EQ5K3NF7PJX/bundle.json","state_url":"https://pith.science/pith/N7CQCDD6MYZZBM2EQ5K3NF7PJX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/N7CQCDD6MYZZBM2EQ5K3NF7PJX/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-05T03:16:01Z","links":{"resolver":"https://pith.science/pith/N7CQCDD6MYZZBM2EQ5K3NF7PJX","bundle":"https://pith.science/pith/N7CQCDD6MYZZBM2EQ5K3NF7PJX/bundle.json","state":"https://pith.science/pith/N7CQCDD6MYZZBM2EQ5K3NF7PJX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/N7CQCDD6MYZZBM2EQ5K3NF7PJX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:N7CQCDD6MYZZBM2EQ5K3NF7PJX","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":"8f9ed19894cd3694eca71fbabc87935ec96bd97a432015f974137d086eff5665","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-01-28T14:58:53Z","title_canon_sha256":"40425f59706ce3c5c9033eb69451422d1ac08b1500a9225d4976855080ae8394"},"schema_version":"1.0","source":{"id":"2201.12165","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2201.12165","created_at":"2026-07-05T04:38:47Z"},{"alias_kind":"arxiv_version","alias_value":"2201.12165v3","created_at":"2026-07-05T04:38:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2201.12165","created_at":"2026-07-05T04:38:47Z"},{"alias_kind":"pith_short_12","alias_value":"N7CQCDD6MYZZ","created_at":"2026-07-05T04:38:47Z"},{"alias_kind":"pith_short_16","alias_value":"N7CQCDD6MYZZBM2E","created_at":"2026-07-05T04:38:47Z"},{"alias_kind":"pith_short_8","alias_value":"N7CQCDD6","created_at":"2026-07-05T04:38:47Z"}],"graph_snapshots":[{"event_id":"sha256:e81036022744ae44eb7aa0a3cafb725f667d2779635b38158fc5734202dc4ed9","target":"graph","created_at":"2026-07-05T04:38:47Z","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/2201.12165/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Invertible transformation of large graphs into fixed dimensional vectors (embeddings) remains a challenge. Its overcoming would reduce any operation on graphs to an operation in a vector space. However, most existing methods are limited to graphs with tens of vertices. In this paper we address the above challenge with recursive neural networks - the encoder and the decoder. The encoder network transforms embeddings of subgraphs into embeddings of larger subgraphs, and eventually into the embedding of the input graph. The decoder does the opposite. The dimension of the embeddings is constant re","authors_text":"Adam Ma{\\l}kowski, Jakub Grzechoci\\'nski, Pawe{\\l} Wawrzy\\'nski","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-01-28T14:58:53Z","title":"ReGAE: Graph autoencoder based on recursive neural networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2201.12165","kind":"arxiv","version":3},"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:0882ecdf198952e9c5937f52712985626792d3ec48594ac701bf58ba9d40d829","target":"record","created_at":"2026-07-05T04:38:47Z","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":"8f9ed19894cd3694eca71fbabc87935ec96bd97a432015f974137d086eff5665","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-01-28T14:58:53Z","title_canon_sha256":"40425f59706ce3c5c9033eb69451422d1ac08b1500a9225d4976855080ae8394"},"schema_version":"1.0","source":{"id":"2201.12165","kind":"arxiv","version":3}},"canonical_sha256":"6fc5010c7e663390b3448755b697ef4df86eb8586895d5aeb5b7bf567e3faf31","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6fc5010c7e663390b3448755b697ef4df86eb8586895d5aeb5b7bf567e3faf31","first_computed_at":"2026-07-05T04:38:47.435663Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T04:38:47.435663Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fVgpWHOjn+BIp5uMDThQDKzGv+yBMN/EtcO4ZqwA9ov9YUUz8izvPpML7HUmBbHb5nG63St9D+GN/vIngCc0BQ==","signature_status":"signed_v1","signed_at":"2026-07-05T04:38:47.436054Z","signed_message":"canonical_sha256_bytes"},"source_id":"2201.12165","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0882ecdf198952e9c5937f52712985626792d3ec48594ac701bf58ba9d40d829","sha256:e81036022744ae44eb7aa0a3cafb725f667d2779635b38158fc5734202dc4ed9"],"state_sha256":"0f1af92791854bc950e35393e6297c4438b3b2f8c76d3a2a971094d0c28fd3ce"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4cZplE/+77zN1Q4LyfVkyBs9epWaV9mTVNlhDPy+l/pKor7I3l3mUH0cZgcVJCbIxh+PEpDa4uDL4ZrbyXReCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-05T03:16:01.259824Z","bundle_sha256":"87e491068392bfa993f939dea850748ddac8100310f3324690558bcd1f497852"}}