{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:WT2T4F3BDUQEWLF2FDAETBWSHT","short_pith_number":"pith:WT2T4F3B","canonical_record":{"source":{"id":"1804.01882","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-04-03T19:25:10Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"5fa59a0ea5111f74f048d1025b1a75433d5f67338e4721d7a5cd1f58c958c0f6","abstract_canon_sha256":"bed9d20837b15268ad23e7c997bb11fec8a64d95ad98590c215362f86f6c6179"},"schema_version":"1.0"},"canonical_sha256":"b4f53e17611d204b2cba28c04986d23cf85c131f43f1a6ccd3b71ed946755eed","source":{"kind":"arxiv","id":"1804.01882","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.01882","created_at":"2026-05-18T00:14:00Z"},{"alias_kind":"arxiv_version","alias_value":"1804.01882v3","created_at":"2026-05-18T00:14:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.01882","created_at":"2026-05-18T00:14:00Z"},{"alias_kind":"pith_short_12","alias_value":"WT2T4F3BDUQE","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_16","alias_value":"WT2T4F3BDUQEWLF2","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_8","alias_value":"WT2T4F3B","created_at":"2026-05-18T12:33:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:WT2T4F3BDUQEWLF2FDAETBWSHT","target":"record","payload":{"canonical_record":{"source":{"id":"1804.01882","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-04-03T19:25:10Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"5fa59a0ea5111f74f048d1025b1a75433d5f67338e4721d7a5cd1f58c958c0f6","abstract_canon_sha256":"bed9d20837b15268ad23e7c997bb11fec8a64d95ad98590c215362f86f6c6179"},"schema_version":"1.0"},"canonical_sha256":"b4f53e17611d204b2cba28c04986d23cf85c131f43f1a6ccd3b71ed946755eed","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:14:00.031095Z","signature_b64":"ypqqRAlPjW/XqVl85psLliFGjqgik3TcO9agK5vV2zM4PidacvS65tZPsUk3nAk8bHSMXOHd/ftdaMLN/jVtAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b4f53e17611d204b2cba28c04986d23cf85c131f43f1a6ccd3b71ed946755eed","last_reissued_at":"2026-05-18T00:14:00.030310Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:14:00.030310Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1804.01882","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-05-18T00:14:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nfFC/Z4cxwuQQBuZKwpfiI+wIacbpgKpqeVSIFp0v7LT8l13jckhw+UZZHgjPQ05WJjq2w4ujC3qOFX97VXqCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T15:46:33.460293Z"},"content_sha256":"749f301e459c45e1349bd6291b2f2f79145d3f5d68cb76af8de3529f18a09e0e","schema_version":"1.0","event_id":"sha256:749f301e459c45e1349bd6291b2f2f79145d3f5d68cb76af8de3529f18a09e0e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:WT2T4F3BDUQEWLF2FDAETBWSHT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Hyperbolic Entailment Cones for Learning Hierarchical Embeddings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Gary B\\'ecigneul, Octavian-Eugen Ganea, Thomas Hofmann","submitted_at":"2018-04-03T19:25:10Z","abstract_excerpt":"Learning graph representations via low-dimensional embeddings that preserve relevant network properties is an important class of problems in machine learning. We here present a novel method to embed directed acyclic graphs. Following prior work, we first advocate for using hyperbolic spaces which provably model tree-like structures better than Euclidean geometry. Second, we view hierarchical relations as partial orders defined using a family of nested geodesically convex cones. We prove that these entailment cones admit an optimal shape with a closed form expression both in the Euclidean and h"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.01882","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":""},"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-05-18T00:14:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1+D0qA/pATnZGSDGkWcHYtsOCyfA1nBsbkWkPC7FVnsK6jF5AhyFlCWJb5lHFf1zOna1y5y+0bHRleC2csSQAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T15:46:33.460735Z"},"content_sha256":"40089f53e6b06aace9af69200471b2733ff0921f2a73eb5f1e56b8a7bfec868f","schema_version":"1.0","event_id":"sha256:40089f53e6b06aace9af69200471b2733ff0921f2a73eb5f1e56b8a7bfec868f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WT2T4F3BDUQEWLF2FDAETBWSHT/bundle.json","state_url":"https://pith.science/pith/WT2T4F3BDUQEWLF2FDAETBWSHT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WT2T4F3BDUQEWLF2FDAETBWSHT/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-05-27T15:46:33Z","links":{"resolver":"https://pith.science/pith/WT2T4F3BDUQEWLF2FDAETBWSHT","bundle":"https://pith.science/pith/WT2T4F3BDUQEWLF2FDAETBWSHT/bundle.json","state":"https://pith.science/pith/WT2T4F3BDUQEWLF2FDAETBWSHT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WT2T4F3BDUQEWLF2FDAETBWSHT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:WT2T4F3BDUQEWLF2FDAETBWSHT","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":"bed9d20837b15268ad23e7c997bb11fec8a64d95ad98590c215362f86f6c6179","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-04-03T19:25:10Z","title_canon_sha256":"5fa59a0ea5111f74f048d1025b1a75433d5f67338e4721d7a5cd1f58c958c0f6"},"schema_version":"1.0","source":{"id":"1804.01882","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.01882","created_at":"2026-05-18T00:14:00Z"},{"alias_kind":"arxiv_version","alias_value":"1804.01882v3","created_at":"2026-05-18T00:14:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.01882","created_at":"2026-05-18T00:14:00Z"},{"alias_kind":"pith_short_12","alias_value":"WT2T4F3BDUQE","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_16","alias_value":"WT2T4F3BDUQEWLF2","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_8","alias_value":"WT2T4F3B","created_at":"2026-05-18T12:33:01Z"}],"graph_snapshots":[{"event_id":"sha256:40089f53e6b06aace9af69200471b2733ff0921f2a73eb5f1e56b8a7bfec868f","target":"graph","created_at":"2026-05-18T00:14: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"},"paper":{"abstract_excerpt":"Learning graph representations via low-dimensional embeddings that preserve relevant network properties is an important class of problems in machine learning. We here present a novel method to embed directed acyclic graphs. Following prior work, we first advocate for using hyperbolic spaces which provably model tree-like structures better than Euclidean geometry. Second, we view hierarchical relations as partial orders defined using a family of nested geodesically convex cones. We prove that these entailment cones admit an optimal shape with a closed form expression both in the Euclidean and h","authors_text":"Gary B\\'ecigneul, Octavian-Eugen Ganea, Thomas Hofmann","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-04-03T19:25:10Z","title":"Hyperbolic Entailment Cones for Learning Hierarchical Embeddings"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.01882","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:749f301e459c45e1349bd6291b2f2f79145d3f5d68cb76af8de3529f18a09e0e","target":"record","created_at":"2026-05-18T00:14: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":"bed9d20837b15268ad23e7c997bb11fec8a64d95ad98590c215362f86f6c6179","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-04-03T19:25:10Z","title_canon_sha256":"5fa59a0ea5111f74f048d1025b1a75433d5f67338e4721d7a5cd1f58c958c0f6"},"schema_version":"1.0","source":{"id":"1804.01882","kind":"arxiv","version":3}},"canonical_sha256":"b4f53e17611d204b2cba28c04986d23cf85c131f43f1a6ccd3b71ed946755eed","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b4f53e17611d204b2cba28c04986d23cf85c131f43f1a6ccd3b71ed946755eed","first_computed_at":"2026-05-18T00:14:00.030310Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:14:00.030310Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ypqqRAlPjW/XqVl85psLliFGjqgik3TcO9agK5vV2zM4PidacvS65tZPsUk3nAk8bHSMXOHd/ftdaMLN/jVtAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:14:00.031095Z","signed_message":"canonical_sha256_bytes"},"source_id":"1804.01882","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:749f301e459c45e1349bd6291b2f2f79145d3f5d68cb76af8de3529f18a09e0e","sha256:40089f53e6b06aace9af69200471b2733ff0921f2a73eb5f1e56b8a7bfec868f"],"state_sha256":"e01b63988f5380fa670e7c9a658db29d21f2bddd88263bed111caf1c9f469d66"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oT1RnNsKiiNy3dzqdU+43NNORrILI6zrrHX+gfDvdoQfYjqaza/hutwFXG2wKWIpYlpEmEzZQDhgtoBFFCpaAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T15:46:33.463550Z","bundle_sha256":"663443ddf8ba78f9032f787421cac168c09ebd537b7a309f111385c0a8811de4"}}