{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:4YKYZHP3GCVPKOPHIMRNJEFQY2","short_pith_number":"pith:4YKYZHP3","schema_version":"1.0","canonical_sha256":"e6158c9dfb30aaf539e74322d490b0c6b5117b2565e9f415f03cd592f75c8d9c","source":{"kind":"arxiv","id":"2403.09662","version":1},"attestation_state":"computed","paper":{"title":"Constrained Multi-Relational Hyper-Graphons with Maximum Entropy","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.GM","authors_text":"Jan Ramon, Juan Alvarado, Yuyi Wang","submitted_at":"2023-12-12T20:50:47Z","abstract_excerpt":"This work has two contributions. The first one is extending the Large Deviation Principle for uniform hyper-graphons from Lubetzky and Zhao \\cite{lubetzky2015replica} to the multi-relational setting where each hyper-graphon can have different arities. This extension enables the formulation of the most typical possible world in Relational Probabilistic Logic with symmetric relational symbols in terms of entropy maximization subjected to constraints of quantum sub-hypergraph densities. The second contribution is to prove the most typical constrained multi-relational hyper-graphons (the most typi"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2403.09662","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.GM","submitted_at":"2023-12-12T20:50:47Z","cross_cats_sorted":[],"title_canon_sha256":"ca10449ac51733f6f214d03943d05efa4201e9efb15565631f6c1c7f893a18b2","abstract_canon_sha256":"f382a2f3141d2f806e19af41fb422e278d99d7af8620055320246786dab04e8f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:56:23.049964Z","signature_b64":"NFL5suRBmTP7bMX4EnvyNHoURWC7bqKtXLzL1SPk2c9xImAgRcTY97X1s8Knx6fjptKPTu7u+IQ0DXSR8jQgAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e6158c9dfb30aaf539e74322d490b0c6b5117b2565e9f415f03cd592f75c8d9c","last_reissued_at":"2026-07-05T07:56:23.049605Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:56:23.049605Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Constrained Multi-Relational Hyper-Graphons with Maximum Entropy","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.GM","authors_text":"Jan Ramon, Juan Alvarado, Yuyi Wang","submitted_at":"2023-12-12T20:50:47Z","abstract_excerpt":"This work has two contributions. The first one is extending the Large Deviation Principle for uniform hyper-graphons from Lubetzky and Zhao \\cite{lubetzky2015replica} to the multi-relational setting where each hyper-graphon can have different arities. This extension enables the formulation of the most typical possible world in Relational Probabilistic Logic with symmetric relational symbols in terms of entropy maximization subjected to constraints of quantum sub-hypergraph densities. The second contribution is to prove the most typical constrained multi-relational hyper-graphons (the most typi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2403.09662","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/2403.09662/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2403.09662","created_at":"2026-07-05T07:56:23.049667+00:00"},{"alias_kind":"arxiv_version","alias_value":"2403.09662v1","created_at":"2026-07-05T07:56:23.049667+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2403.09662","created_at":"2026-07-05T07:56:23.049667+00:00"},{"alias_kind":"pith_short_12","alias_value":"4YKYZHP3GCVP","created_at":"2026-07-05T07:56:23.049667+00:00"},{"alias_kind":"pith_short_16","alias_value":"4YKYZHP3GCVPKOPH","created_at":"2026-07-05T07:56:23.049667+00:00"},{"alias_kind":"pith_short_8","alias_value":"4YKYZHP3","created_at":"2026-07-05T07:56:23.049667+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2505.16401","citing_title":"Divide-Fuse-Conquer: Eliciting \"Aha Moments\" in Multi-Scenario Games","ref_index":3,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4YKYZHP3GCVPKOPHIMRNJEFQY2","json":"https://pith.science/pith/4YKYZHP3GCVPKOPHIMRNJEFQY2.json","graph_json":"https://pith.science/api/pith-number/4YKYZHP3GCVPKOPHIMRNJEFQY2/graph.json","events_json":"https://pith.science/api/pith-number/4YKYZHP3GCVPKOPHIMRNJEFQY2/events.json","paper":"https://pith.science/paper/4YKYZHP3"},"agent_actions":{"view_html":"https://pith.science/pith/4YKYZHP3GCVPKOPHIMRNJEFQY2","download_json":"https://pith.science/pith/4YKYZHP3GCVPKOPHIMRNJEFQY2.json","view_paper":"https://pith.science/paper/4YKYZHP3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2403.09662&json=true","fetch_graph":"https://pith.science/api/pith-number/4YKYZHP3GCVPKOPHIMRNJEFQY2/graph.json","fetch_events":"https://pith.science/api/pith-number/4YKYZHP3GCVPKOPHIMRNJEFQY2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4YKYZHP3GCVPKOPHIMRNJEFQY2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4YKYZHP3GCVPKOPHIMRNJEFQY2/action/storage_attestation","attest_author":"https://pith.science/pith/4YKYZHP3GCVPKOPHIMRNJEFQY2/action/author_attestation","sign_citation":"https://pith.science/pith/4YKYZHP3GCVPKOPHIMRNJEFQY2/action/citation_signature","submit_replication":"https://pith.science/pith/4YKYZHP3GCVPKOPHIMRNJEFQY2/action/replication_record"}},"created_at":"2026-07-05T07:56:23.049667+00:00","updated_at":"2026-07-05T07:56:23.049667+00:00"}