{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:YXBYVMUREH4H4TPDTAUA5RHLAQ","short_pith_number":"pith:YXBYVMUR","canonical_record":{"source":{"id":"2605.26201","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.CO","submitted_at":"2026-05-25T17:50:30Z","cross_cats_sorted":[],"title_canon_sha256":"ef67789b3da265ebe061a94f00be54745320d294863834bc917a739173c423c6","abstract_canon_sha256":"c791d2223b51f559e5a8755becf7def411358aa2afc24c33914aa2a6e09d848a"},"schema_version":"1.0"},"canonical_sha256":"c5c38ab29121f87e4de398280ec4eb0419cc06764cfa7f4e7e1c1d551319f879","source":{"kind":"arxiv","id":"2605.26201","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.26201","created_at":"2026-05-27T00:04:28Z"},{"alias_kind":"arxiv_version","alias_value":"2605.26201v1","created_at":"2026-05-27T00:04:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.26201","created_at":"2026-05-27T00:04:28Z"},{"alias_kind":"pith_short_12","alias_value":"YXBYVMUREH4H","created_at":"2026-05-27T00:04:28Z"},{"alias_kind":"pith_short_16","alias_value":"YXBYVMUREH4H4TPD","created_at":"2026-05-27T00:04:28Z"},{"alias_kind":"pith_short_8","alias_value":"YXBYVMUR","created_at":"2026-05-27T00:04:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:YXBYVMUREH4H4TPDTAUA5RHLAQ","target":"record","payload":{"canonical_record":{"source":{"id":"2605.26201","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.CO","submitted_at":"2026-05-25T17:50:30Z","cross_cats_sorted":[],"title_canon_sha256":"ef67789b3da265ebe061a94f00be54745320d294863834bc917a739173c423c6","abstract_canon_sha256":"c791d2223b51f559e5a8755becf7def411358aa2afc24c33914aa2a6e09d848a"},"schema_version":"1.0"},"canonical_sha256":"c5c38ab29121f87e4de398280ec4eb0419cc06764cfa7f4e7e1c1d551319f879","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-27T00:04:28.574507Z","signature_b64":"vLcANYgVUnhpm/RSdsvfwAzv9EEu2Y0ggkxPQ8SzWFVtnav57LNfPK+CjKGESDVf6zjM/PV8eKzwN3aYQPVMAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c5c38ab29121f87e4de398280ec4eb0419cc06764cfa7f4e7e1c1d551319f879","last_reissued_at":"2026-05-27T00:04:28.573597Z","signature_status":"signed_v1","first_computed_at":"2026-05-27T00:04:28.573597Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.26201","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-05-27T00:04:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"e8JaRglxH9uMKPs3AkLU4kAn5rugQUBN5pItDVrl6+TIGuZILY0Gmu3E7NEvCDdv41CiGhmxnqox2SbVoXbyCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T07:59:54.878370Z"},"content_sha256":"6bff029cde0965abc834342bb8a6660f86cd9126500861bc96415170b0dd8a6b","schema_version":"1.0","event_id":"sha256:6bff029cde0965abc834342bb8a6660f86cd9126500861bc96415170b0dd8a6b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:YXBYVMUREH4H4TPDTAUA5RHLAQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A note on integer programming methods for mixed radial Moore graphs","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"A. Abiad, Jes\\'us M. Ceresuela, N. L\\'opez","submitted_at":"2026-05-25T17:50:30Z","abstract_excerpt":"Mixed radial Moore graphs are approximations of mixed Moore graphs that preserve the distance-preserving spanning tree for some vertices. One way to measure their resemblance to a mixed Moore graph is using the status measure. The status of a graph is defined as the sum of the distances between all pairs of ordered vertices. Mixed radial Moore graphs with minimum status are closer to mixed Moore graphs according to this measure. The existence of mixed radial Moore graphs is still unknown for most values of the degree and the diameter. In this work, we develop an integer programming model (IP) "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.26201","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/2605.26201/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-05-27T00:04:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SsuFZe9RlAY4aIoACUQjBXylXC9h37Eq4oiCLdvSWRD1y0eh/s+KVg8LCvsWwnD9XNkPXhGhE3PmzAATy1oqCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T07:59:54.878758Z"},"content_sha256":"5a1119eec0147ee3b7b6405b54993ef236aa2f42ea1feb4a7c11deded0df4164","schema_version":"1.0","event_id":"sha256:5a1119eec0147ee3b7b6405b54993ef236aa2f42ea1feb4a7c11deded0df4164"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YXBYVMUREH4H4TPDTAUA5RHLAQ/bundle.json","state_url":"https://pith.science/pith/YXBYVMUREH4H4TPDTAUA5RHLAQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YXBYVMUREH4H4TPDTAUA5RHLAQ/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-06-23T07:59:54Z","links":{"resolver":"https://pith.science/pith/YXBYVMUREH4H4TPDTAUA5RHLAQ","bundle":"https://pith.science/pith/YXBYVMUREH4H4TPDTAUA5RHLAQ/bundle.json","state":"https://pith.science/pith/YXBYVMUREH4H4TPDTAUA5RHLAQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YXBYVMUREH4H4TPDTAUA5RHLAQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:YXBYVMUREH4H4TPDTAUA5RHLAQ","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":"c791d2223b51f559e5a8755becf7def411358aa2afc24c33914aa2a6e09d848a","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.CO","submitted_at":"2026-05-25T17:50:30Z","title_canon_sha256":"ef67789b3da265ebe061a94f00be54745320d294863834bc917a739173c423c6"},"schema_version":"1.0","source":{"id":"2605.26201","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.26201","created_at":"2026-05-27T00:04:28Z"},{"alias_kind":"arxiv_version","alias_value":"2605.26201v1","created_at":"2026-05-27T00:04:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.26201","created_at":"2026-05-27T00:04:28Z"},{"alias_kind":"pith_short_12","alias_value":"YXBYVMUREH4H","created_at":"2026-05-27T00:04:28Z"},{"alias_kind":"pith_short_16","alias_value":"YXBYVMUREH4H4TPD","created_at":"2026-05-27T00:04:28Z"},{"alias_kind":"pith_short_8","alias_value":"YXBYVMUR","created_at":"2026-05-27T00:04:28Z"}],"graph_snapshots":[{"event_id":"sha256:5a1119eec0147ee3b7b6405b54993ef236aa2f42ea1feb4a7c11deded0df4164","target":"graph","created_at":"2026-05-27T00:04:28Z","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/2605.26201/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Mixed radial Moore graphs are approximations of mixed Moore graphs that preserve the distance-preserving spanning tree for some vertices. One way to measure their resemblance to a mixed Moore graph is using the status measure. The status of a graph is defined as the sum of the distances between all pairs of ordered vertices. Mixed radial Moore graphs with minimum status are closer to mixed Moore graphs according to this measure. The existence of mixed radial Moore graphs is still unknown for most values of the degree and the diameter. In this work, we develop an integer programming model (IP) ","authors_text":"A. Abiad, Jes\\'us M. Ceresuela, N. L\\'opez","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.CO","submitted_at":"2026-05-25T17:50:30Z","title":"A note on integer programming methods for mixed radial Moore graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.26201","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:6bff029cde0965abc834342bb8a6660f86cd9126500861bc96415170b0dd8a6b","target":"record","created_at":"2026-05-27T00:04:28Z","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":"c791d2223b51f559e5a8755becf7def411358aa2afc24c33914aa2a6e09d848a","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.CO","submitted_at":"2026-05-25T17:50:30Z","title_canon_sha256":"ef67789b3da265ebe061a94f00be54745320d294863834bc917a739173c423c6"},"schema_version":"1.0","source":{"id":"2605.26201","kind":"arxiv","version":1}},"canonical_sha256":"c5c38ab29121f87e4de398280ec4eb0419cc06764cfa7f4e7e1c1d551319f879","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c5c38ab29121f87e4de398280ec4eb0419cc06764cfa7f4e7e1c1d551319f879","first_computed_at":"2026-05-27T00:04:28.573597Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-27T00:04:28.573597Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vLcANYgVUnhpm/RSdsvfwAzv9EEu2Y0ggkxPQ8SzWFVtnav57LNfPK+CjKGESDVf6zjM/PV8eKzwN3aYQPVMAA==","signature_status":"signed_v1","signed_at":"2026-05-27T00:04:28.574507Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.26201","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6bff029cde0965abc834342bb8a6660f86cd9126500861bc96415170b0dd8a6b","sha256:5a1119eec0147ee3b7b6405b54993ef236aa2f42ea1feb4a7c11deded0df4164"],"state_sha256":"0f6556c4cb47db92cc571589ac82e6eed7d63597b7195f8a86abedaee55b3da9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"v2trTNY9ejsOOOpNKvRTcd09daKQxVwXQtboVD5jyIw19UbyCd0PazQDYyoFXte5XapzMlcS+tWRn2SEPRXSDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T07:59:54.880817Z","bundle_sha256":"e20a63669dbb1f4e5ce6f779b4f1e395e07c57311ee42139567cff130e50fbeb"}}