{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:MG534H3OIQPVWVU2O6UHTHWJ3O","short_pith_number":"pith:MG534H3O","canonical_record":{"source":{"id":"2607.22383","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-07-24T15:08:24Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"c3158ffa2ec1a1ee9e8f57a62badf6731591e17ff69faa1304e4f1acf3ac3bc9","abstract_canon_sha256":"6f5f16bd9aabbb8df168bd586b8396aa1d576155093cdbda3fb844bb84eec3bb"},"schema_version":"1.0"},"canonical_sha256":"61bbbe1f6e441f5b569a77a8799ec9db93cffd007e571d4952d31a088f8b9ffa","source":{"kind":"arxiv","id":"2607.22383","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.22383","created_at":"2026-07-27T01:21:17Z"},{"alias_kind":"arxiv_version","alias_value":"2607.22383v1","created_at":"2026-07-27T01:21:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.22383","created_at":"2026-07-27T01:21:17Z"},{"alias_kind":"pith_short_12","alias_value":"MG534H3OIQPV","created_at":"2026-07-27T01:21:17Z"},{"alias_kind":"pith_short_16","alias_value":"MG534H3OIQPVWVU2","created_at":"2026-07-27T01:21:17Z"},{"alias_kind":"pith_short_8","alias_value":"MG534H3O","created_at":"2026-07-27T01:21:17Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:MG534H3OIQPVWVU2O6UHTHWJ3O","target":"record","payload":{"canonical_record":{"source":{"id":"2607.22383","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-07-24T15:08:24Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"c3158ffa2ec1a1ee9e8f57a62badf6731591e17ff69faa1304e4f1acf3ac3bc9","abstract_canon_sha256":"6f5f16bd9aabbb8df168bd586b8396aa1d576155093cdbda3fb844bb84eec3bb"},"schema_version":"1.0"},"canonical_sha256":"61bbbe1f6e441f5b569a77a8799ec9db93cffd007e571d4952d31a088f8b9ffa","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-27T01:21:17.660578Z","signature_b64":"9zJDCXw+xGLyg8D30hNPnGVPvUJfsvlpJ65V2IhhrnOdwca22lrsKJZFmvUmdayGe/vcUCTzJDFws5aXC+r6Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"61bbbe1f6e441f5b569a77a8799ec9db93cffd007e571d4952d31a088f8b9ffa","last_reissued_at":"2026-07-27T01:21:17.659733Z","signature_status":"signed_v1","first_computed_at":"2026-07-27T01:21:17.659733Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2607.22383","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-27T01:21:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Y9t/AJ4wfoVU6E/Ej94F+qY3y/YrcS9jhZIonKfMTZ1XbT3pLmZHvdGWvGIV7RiLfDyFcu+yW/H5ls7nH1DuDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-18T00:08:58.500875Z"},"content_sha256":"c3d9ade2c0c0bc9aac325a57cb8247d7018b605baff3e54011e82f0c07feb8b0","schema_version":"1.0","event_id":"sha256:c3d9ade2c0c0bc9aac325a57cb8247d7018b605baff3e54011e82f0c07feb8b0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:MG534H3OIQPVWVU2O6UHTHWJ3O","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Constrained Multi-Relational Graphons with Maximum Entropy","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"math.CO","authors_text":"Jan Ramon, Juan Alvarado, Yuyi Wang","submitted_at":"2026-07-24T15:08:24Z","abstract_excerpt":"The principle of maximum entropy provides a fundamental framework for characterizing typical structures of large random networks subject to observable constraints. In their pioneering numerical experiments \\cite{radin2014asymptotics}, Radin, Ren, and Sadun conjectured that entropy-maximizing graphons satisfying subgraph density constraints are stochastic block models a conjecture we term the RRS conjecture. While several special cases have been proven for single-relation graphs with specific constraint families, the general problem has remained open, particularly for multi-relational networks."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.22383","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/2607.22383/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-27T01:21:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hb8U/Foj/uFutNLyTh/X96gm7+d7WEgk5zzT/m48E6Puty0RUTtw+goJpORAyfoJ5jPM7RdCZM/opYq0deNyBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-18T00:08:58.501806Z"},"content_sha256":"8bf435a6616c136acf520b4d9e3f5fd368de94b91a2e325c5ade37e29c038078","schema_version":"1.0","event_id":"sha256:8bf435a6616c136acf520b4d9e3f5fd368de94b91a2e325c5ade37e29c038078"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MG534H3OIQPVWVU2O6UHTHWJ3O/bundle.json","state_url":"https://pith.science/pith/MG534H3OIQPVWVU2O6UHTHWJ3O/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MG534H3OIQPVWVU2O6UHTHWJ3O/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-18T00:08:58Z","links":{"resolver":"https://pith.science/pith/MG534H3OIQPVWVU2O6UHTHWJ3O","bundle":"https://pith.science/pith/MG534H3OIQPVWVU2O6UHTHWJ3O/bundle.json","state":"https://pith.science/pith/MG534H3OIQPVWVU2O6UHTHWJ3O/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MG534H3OIQPVWVU2O6UHTHWJ3O/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:MG534H3OIQPVWVU2O6UHTHWJ3O","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":"6f5f16bd9aabbb8df168bd586b8396aa1d576155093cdbda3fb844bb84eec3bb","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-07-24T15:08:24Z","title_canon_sha256":"c3158ffa2ec1a1ee9e8f57a62badf6731591e17ff69faa1304e4f1acf3ac3bc9"},"schema_version":"1.0","source":{"id":"2607.22383","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.22383","created_at":"2026-07-27T01:21:17Z"},{"alias_kind":"arxiv_version","alias_value":"2607.22383v1","created_at":"2026-07-27T01:21:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.22383","created_at":"2026-07-27T01:21:17Z"},{"alias_kind":"pith_short_12","alias_value":"MG534H3OIQPV","created_at":"2026-07-27T01:21:17Z"},{"alias_kind":"pith_short_16","alias_value":"MG534H3OIQPVWVU2","created_at":"2026-07-27T01:21:17Z"},{"alias_kind":"pith_short_8","alias_value":"MG534H3O","created_at":"2026-07-27T01:21:17Z"}],"graph_snapshots":[{"event_id":"sha256:8bf435a6616c136acf520b4d9e3f5fd368de94b91a2e325c5ade37e29c038078","target":"graph","created_at":"2026-07-27T01:21:17Z","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/2607.22383/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The principle of maximum entropy provides a fundamental framework for characterizing typical structures of large random networks subject to observable constraints. In their pioneering numerical experiments \\cite{radin2014asymptotics}, Radin, Ren, and Sadun conjectured that entropy-maximizing graphons satisfying subgraph density constraints are stochastic block models a conjecture we term the RRS conjecture. While several special cases have been proven for single-relation graphs with specific constraint families, the general problem has remained open, particularly for multi-relational networks.","authors_text":"Jan Ramon, Juan Alvarado, Yuyi Wang","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-07-24T15:08:24Z","title":"Constrained Multi-Relational Graphons with Maximum Entropy"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.22383","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:c3d9ade2c0c0bc9aac325a57cb8247d7018b605baff3e54011e82f0c07feb8b0","target":"record","created_at":"2026-07-27T01:21:17Z","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":"6f5f16bd9aabbb8df168bd586b8396aa1d576155093cdbda3fb844bb84eec3bb","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-07-24T15:08:24Z","title_canon_sha256":"c3158ffa2ec1a1ee9e8f57a62badf6731591e17ff69faa1304e4f1acf3ac3bc9"},"schema_version":"1.0","source":{"id":"2607.22383","kind":"arxiv","version":1}},"canonical_sha256":"61bbbe1f6e441f5b569a77a8799ec9db93cffd007e571d4952d31a088f8b9ffa","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"61bbbe1f6e441f5b569a77a8799ec9db93cffd007e571d4952d31a088f8b9ffa","first_computed_at":"2026-07-27T01:21:17.659733Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-27T01:21:17.659733Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9zJDCXw+xGLyg8D30hNPnGVPvUJfsvlpJ65V2IhhrnOdwca22lrsKJZFmvUmdayGe/vcUCTzJDFws5aXC+r6Cw==","signature_status":"signed_v1","signed_at":"2026-07-27T01:21:17.660578Z","signed_message":"canonical_sha256_bytes"},"source_id":"2607.22383","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c3d9ade2c0c0bc9aac325a57cb8247d7018b605baff3e54011e82f0c07feb8b0","sha256:8bf435a6616c136acf520b4d9e3f5fd368de94b91a2e325c5ade37e29c038078"],"state_sha256":"2341d5b6e8c39b8cbfb08e6030a4a54edb41a2d7c013c2ed246b759f8c2114fc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7rnkAmsMvG9/NK8pttFF9sVNNldguqRCJkhrb644NUaIfGucxGdB7APBpvKAlpwuTvTDEvyhb/lJoXV7tYgVCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-18T00:08:58.510951Z","bundle_sha256":"aad4345e04da075e36139eb838ea06c9585756f1d9a10d3f8d395a619f4ab215"}}