{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:WQR62ZZIDOZKUUORDSVVUI4ALA","short_pith_number":"pith:WQR62ZZI","canonical_record":{"source":{"id":"2509.08772","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2025-09-10T17:02:30Z","cross_cats_sorted":[],"title_canon_sha256":"93e389855334fd58eb39a93a21da647ac84dea03adf09abccc24c1780169f360","abstract_canon_sha256":"5a2dfe301901a25ae2e20730d54053933feeb783361c306461afe4551e214184"},"schema_version":"1.0"},"canonical_sha256":"b423ed67281bb2aa51d11cab5a23805832cb77f00cf305c9135e0270e9aced9b","source":{"kind":"arxiv","id":"2509.08772","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2509.08772","created_at":"2026-07-05T12:08:36Z"},{"alias_kind":"arxiv_version","alias_value":"2509.08772v1","created_at":"2026-07-05T12:08:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2509.08772","created_at":"2026-07-05T12:08:36Z"},{"alias_kind":"pith_short_12","alias_value":"WQR62ZZIDOZK","created_at":"2026-07-05T12:08:36Z"},{"alias_kind":"pith_short_16","alias_value":"WQR62ZZIDOZKUUOR","created_at":"2026-07-05T12:08:36Z"},{"alias_kind":"pith_short_8","alias_value":"WQR62ZZI","created_at":"2026-07-05T12:08:36Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:WQR62ZZIDOZKUUORDSVVUI4ALA","target":"record","payload":{"canonical_record":{"source":{"id":"2509.08772","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2025-09-10T17:02:30Z","cross_cats_sorted":[],"title_canon_sha256":"93e389855334fd58eb39a93a21da647ac84dea03adf09abccc24c1780169f360","abstract_canon_sha256":"5a2dfe301901a25ae2e20730d54053933feeb783361c306461afe4551e214184"},"schema_version":"1.0"},"canonical_sha256":"b423ed67281bb2aa51d11cab5a23805832cb77f00cf305c9135e0270e9aced9b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T12:08:36.003240Z","signature_b64":"UIQUlQWiub3zFKns79IL3M+EC/6KMxbTPYKpb1Bk9be6rO/Qf8QDfAJPCJ6ek4yp6FhKrYXiGH8lyQi0yhDMAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b423ed67281bb2aa51d11cab5a23805832cb77f00cf305c9135e0270e9aced9b","last_reissued_at":"2026-07-05T12:08:36.002560Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T12:08:36.002560Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2509.08772","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-05T12:08:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hNI4gg/+mHHAOeaodfNmbymgQVYrezwAkTGrmHaCOmSpEyIEAuX5vC4LimblpWnW6wNErMMyVjwaRFSwRpKfDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-21T19:34:58.024671Z"},"content_sha256":"5f4b8ad5b025d6289e2319e23a67acb27eca5466ca2ae3706a4163e9ed9164d1","schema_version":"1.0","event_id":"sha256:5f4b8ad5b025d6289e2319e23a67acb27eca5466ca2ae3706a4163e9ed9164d1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:WQR62ZZIDOZKUUORDSVVUI4ALA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimization of geometric hypergraph embedding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SI","authors_text":"Desmond J. Higham, Francesco Zigliotto","submitted_at":"2025-09-10T17:02:30Z","abstract_excerpt":"We consider the problem of embedding the nodes of a hypergraph into Euclidean space under the assumption that the interactions arose through closeness to unknown hyperedge centres. In this way, we tackle the inverse problem associated with the generation of geometric random hypergraphs. We propose two new spectral algorithms; both of these exploit the connection between hypergraphs and bipartite graphs. The assumption of an underlying geometric structure allows us to define a concrete measure of success that can be used to optimize the embedding via gradient descent. Synthetic tests show that "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2509.08772","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/2509.08772/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-05T12:08:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/AkH/P64sBul4oaKNudcAbUAAOzcBPhDuwTAfXWOms9lyt2fyhvYAZkh3kYTAGMlSk+n9/ihf4JP1bI094cmDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-21T19:34:58.025044Z"},"content_sha256":"ebd5ab859972f4d1f640d4cc55a711174019031372100a5d01ceb8c3a2e23ccd","schema_version":"1.0","event_id":"sha256:ebd5ab859972f4d1f640d4cc55a711174019031372100a5d01ceb8c3a2e23ccd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WQR62ZZIDOZKUUORDSVVUI4ALA/bundle.json","state_url":"https://pith.science/pith/WQR62ZZIDOZKUUORDSVVUI4ALA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WQR62ZZIDOZKUUORDSVVUI4ALA/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-21T19:34:58Z","links":{"resolver":"https://pith.science/pith/WQR62ZZIDOZKUUORDSVVUI4ALA","bundle":"https://pith.science/pith/WQR62ZZIDOZKUUORDSVVUI4ALA/bundle.json","state":"https://pith.science/pith/WQR62ZZIDOZKUUORDSVVUI4ALA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WQR62ZZIDOZKUUORDSVVUI4ALA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:WQR62ZZIDOZKUUORDSVVUI4ALA","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":"5a2dfe301901a25ae2e20730d54053933feeb783361c306461afe4551e214184","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2025-09-10T17:02:30Z","title_canon_sha256":"93e389855334fd58eb39a93a21da647ac84dea03adf09abccc24c1780169f360"},"schema_version":"1.0","source":{"id":"2509.08772","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2509.08772","created_at":"2026-07-05T12:08:36Z"},{"alias_kind":"arxiv_version","alias_value":"2509.08772v1","created_at":"2026-07-05T12:08:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2509.08772","created_at":"2026-07-05T12:08:36Z"},{"alias_kind":"pith_short_12","alias_value":"WQR62ZZIDOZK","created_at":"2026-07-05T12:08:36Z"},{"alias_kind":"pith_short_16","alias_value":"WQR62ZZIDOZKUUOR","created_at":"2026-07-05T12:08:36Z"},{"alias_kind":"pith_short_8","alias_value":"WQR62ZZI","created_at":"2026-07-05T12:08:36Z"}],"graph_snapshots":[{"event_id":"sha256:ebd5ab859972f4d1f640d4cc55a711174019031372100a5d01ceb8c3a2e23ccd","target":"graph","created_at":"2026-07-05T12:08:36Z","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/2509.08772/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We consider the problem of embedding the nodes of a hypergraph into Euclidean space under the assumption that the interactions arose through closeness to unknown hyperedge centres. In this way, we tackle the inverse problem associated with the generation of geometric random hypergraphs. We propose two new spectral algorithms; both of these exploit the connection between hypergraphs and bipartite graphs. The assumption of an underlying geometric structure allows us to define a concrete measure of success that can be used to optimize the embedding via gradient descent. Synthetic tests show that ","authors_text":"Desmond J. Higham, Francesco Zigliotto","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2025-09-10T17:02:30Z","title":"Optimization of geometric hypergraph embedding"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2509.08772","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:5f4b8ad5b025d6289e2319e23a67acb27eca5466ca2ae3706a4163e9ed9164d1","target":"record","created_at":"2026-07-05T12:08:36Z","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":"5a2dfe301901a25ae2e20730d54053933feeb783361c306461afe4551e214184","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2025-09-10T17:02:30Z","title_canon_sha256":"93e389855334fd58eb39a93a21da647ac84dea03adf09abccc24c1780169f360"},"schema_version":"1.0","source":{"id":"2509.08772","kind":"arxiv","version":1}},"canonical_sha256":"b423ed67281bb2aa51d11cab5a23805832cb77f00cf305c9135e0270e9aced9b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b423ed67281bb2aa51d11cab5a23805832cb77f00cf305c9135e0270e9aced9b","first_computed_at":"2026-07-05T12:08:36.002560Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T12:08:36.002560Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"UIQUlQWiub3zFKns79IL3M+EC/6KMxbTPYKpb1Bk9be6rO/Qf8QDfAJPCJ6ek4yp6FhKrYXiGH8lyQi0yhDMAg==","signature_status":"signed_v1","signed_at":"2026-07-05T12:08:36.003240Z","signed_message":"canonical_sha256_bytes"},"source_id":"2509.08772","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5f4b8ad5b025d6289e2319e23a67acb27eca5466ca2ae3706a4163e9ed9164d1","sha256:ebd5ab859972f4d1f640d4cc55a711174019031372100a5d01ceb8c3a2e23ccd"],"state_sha256":"cccb1079afd0d37616ce2522567e7d26195551effe7f4882b433d1b8dd60203b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cyylU29I8jJ7F67MueYrCh4O/rphfRGjuJYNxHvLYBN1lzdqPHtTptLpVqLdvqhmAbKvOUMIY/t+gQ3togoZDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-21T19:34:58.027616Z","bundle_sha256":"dcc116004fd7517574724dcfab8fd6420a5af9f52d997b8aae056866b45ec63a"}}