{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:LXQ422Z7NKCQSMZKTE2GSYMV7G","short_pith_number":"pith:LXQ422Z7","canonical_record":{"source":{"id":"1406.7259","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"physics.soc-ph","submitted_at":"2014-06-27T18:13:11Z","cross_cats_sorted":["cs.SI"],"title_canon_sha256":"b391aa37cb3490e81eb9bf16cfe20a8884f283d10132eb65935712bf8f6c6ef4","abstract_canon_sha256":"81c65e929136fe322b2e8a15274ed4a1d5da58d2442bb0e7be9789bc7e1dd201"},"schema_version":"1.0"},"canonical_sha256":"5de1cd6b3f6a8509332a9934696195f9bcefe194fb2f4aa2d9506893cdf7da60","source":{"kind":"arxiv","id":"1406.7259","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1406.7259","created_at":"2026-05-18T02:48:53Z"},{"alias_kind":"arxiv_version","alias_value":"1406.7259v1","created_at":"2026-05-18T02:48:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.7259","created_at":"2026-05-18T02:48:53Z"},{"alias_kind":"pith_short_12","alias_value":"LXQ422Z7NKCQ","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_16","alias_value":"LXQ422Z7NKCQSMZK","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_8","alias_value":"LXQ422Z7","created_at":"2026-05-18T12:28:38Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:LXQ422Z7NKCQSMZKTE2GSYMV7G","target":"record","payload":{"canonical_record":{"source":{"id":"1406.7259","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"physics.soc-ph","submitted_at":"2014-06-27T18:13:11Z","cross_cats_sorted":["cs.SI"],"title_canon_sha256":"b391aa37cb3490e81eb9bf16cfe20a8884f283d10132eb65935712bf8f6c6ef4","abstract_canon_sha256":"81c65e929136fe322b2e8a15274ed4a1d5da58d2442bb0e7be9789bc7e1dd201"},"schema_version":"1.0"},"canonical_sha256":"5de1cd6b3f6a8509332a9934696195f9bcefe194fb2f4aa2d9506893cdf7da60","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:48:53.757813Z","signature_b64":"09IEgszpe5Lf9+95ZX3+F2wgQ9+0obkGLMmU7YAnymXMU/sSzgQe/AfK5EYApN7easNQfXFwN3VilfevKCG2CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5de1cd6b3f6a8509332a9934696195f9bcefe194fb2f4aa2d9506893cdf7da60","last_reissued_at":"2026-05-18T02:48:53.757237Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:48:53.757237Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1406.7259","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-18T02:48:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eOBbKKzMWS2ksd5Kt7o2zPc1R6XzhQys4o37V9AdqTIWqcCbZdGe9cpRfTCs4S+7v+M0ekCsGIme5mZaiOpaCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T08:37:23.872608Z"},"content_sha256":"4901075a5778fabb3893ecf27d6e2221802026be67f7b19b02c5cbe32c9828fb","schema_version":"1.0","event_id":"sha256:4901075a5778fabb3893ecf27d6e2221802026be67f7b19b02c5cbe32c9828fb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:LXQ422Z7NKCQSMZKTE2GSYMV7G","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Mandala Networks: ultra-robust, ultra-small-world and highly sparse graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI"],"primary_cat":"physics.soc-ph","authors_text":"A. A. Moreira, C. I. N. Sampaio Filho, H. J. Herrmann, J. S. Andrade Jr, R. F. S. Andrade","submitted_at":"2014-06-27T18:13:11Z","abstract_excerpt":"The increasing demands in security and reliability of infrastructures call for the optimal design of their embedded complex networks topologies. The following question then arises: what is the optimal layout to fulfill best all the demands? Here we present a general solution for this problem with scale-free networks, like the Internet and airline networks. Precisely, we disclose a way to systematically construct networks which are 100$\\%$ robust against random failures as well as to malicious attacks. Furthermore, as the sizes of these networks increase, their shortest paths become asymptotica"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.7259","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":""},"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-18T02:48:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0jT82JihF7H0A+o7xXnBqXwp3c3edSeAYvj2jd2VAPQrqN8DMWFKOJQ/1b7+xP8aArp+KtmNDsE3LckG9VvPDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T08:37:23.873345Z"},"content_sha256":"1befc78e186963952ffb01d4c1483927e1d976035c482a5d0cb5532157411699","schema_version":"1.0","event_id":"sha256:1befc78e186963952ffb01d4c1483927e1d976035c482a5d0cb5532157411699"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LXQ422Z7NKCQSMZKTE2GSYMV7G/bundle.json","state_url":"https://pith.science/pith/LXQ422Z7NKCQSMZKTE2GSYMV7G/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LXQ422Z7NKCQSMZKTE2GSYMV7G/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-26T08:37:23Z","links":{"resolver":"https://pith.science/pith/LXQ422Z7NKCQSMZKTE2GSYMV7G","bundle":"https://pith.science/pith/LXQ422Z7NKCQSMZKTE2GSYMV7G/bundle.json","state":"https://pith.science/pith/LXQ422Z7NKCQSMZKTE2GSYMV7G/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LXQ422Z7NKCQSMZKTE2GSYMV7G/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:LXQ422Z7NKCQSMZKTE2GSYMV7G","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":"81c65e929136fe322b2e8a15274ed4a1d5da58d2442bb0e7be9789bc7e1dd201","cross_cats_sorted":["cs.SI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"physics.soc-ph","submitted_at":"2014-06-27T18:13:11Z","title_canon_sha256":"b391aa37cb3490e81eb9bf16cfe20a8884f283d10132eb65935712bf8f6c6ef4"},"schema_version":"1.0","source":{"id":"1406.7259","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1406.7259","created_at":"2026-05-18T02:48:53Z"},{"alias_kind":"arxiv_version","alias_value":"1406.7259v1","created_at":"2026-05-18T02:48:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.7259","created_at":"2026-05-18T02:48:53Z"},{"alias_kind":"pith_short_12","alias_value":"LXQ422Z7NKCQ","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_16","alias_value":"LXQ422Z7NKCQSMZK","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_8","alias_value":"LXQ422Z7","created_at":"2026-05-18T12:28:38Z"}],"graph_snapshots":[{"event_id":"sha256:1befc78e186963952ffb01d4c1483927e1d976035c482a5d0cb5532157411699","target":"graph","created_at":"2026-05-18T02:48:53Z","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":"The increasing demands in security and reliability of infrastructures call for the optimal design of their embedded complex networks topologies. The following question then arises: what is the optimal layout to fulfill best all the demands? Here we present a general solution for this problem with scale-free networks, like the Internet and airline networks. Precisely, we disclose a way to systematically construct networks which are 100$\\%$ robust against random failures as well as to malicious attacks. Furthermore, as the sizes of these networks increase, their shortest paths become asymptotica","authors_text":"A. A. Moreira, C. I. N. Sampaio Filho, H. J. Herrmann, J. S. Andrade Jr, R. F. S. Andrade","cross_cats":["cs.SI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"physics.soc-ph","submitted_at":"2014-06-27T18:13:11Z","title":"Mandala Networks: ultra-robust, ultra-small-world and highly sparse graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.7259","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:4901075a5778fabb3893ecf27d6e2221802026be67f7b19b02c5cbe32c9828fb","target":"record","created_at":"2026-05-18T02:48:53Z","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":"81c65e929136fe322b2e8a15274ed4a1d5da58d2442bb0e7be9789bc7e1dd201","cross_cats_sorted":["cs.SI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"physics.soc-ph","submitted_at":"2014-06-27T18:13:11Z","title_canon_sha256":"b391aa37cb3490e81eb9bf16cfe20a8884f283d10132eb65935712bf8f6c6ef4"},"schema_version":"1.0","source":{"id":"1406.7259","kind":"arxiv","version":1}},"canonical_sha256":"5de1cd6b3f6a8509332a9934696195f9bcefe194fb2f4aa2d9506893cdf7da60","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5de1cd6b3f6a8509332a9934696195f9bcefe194fb2f4aa2d9506893cdf7da60","first_computed_at":"2026-05-18T02:48:53.757237Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:48:53.757237Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"09IEgszpe5Lf9+95ZX3+F2wgQ9+0obkGLMmU7YAnymXMU/sSzgQe/AfK5EYApN7easNQfXFwN3VilfevKCG2CA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:48:53.757813Z","signed_message":"canonical_sha256_bytes"},"source_id":"1406.7259","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4901075a5778fabb3893ecf27d6e2221802026be67f7b19b02c5cbe32c9828fb","sha256:1befc78e186963952ffb01d4c1483927e1d976035c482a5d0cb5532157411699"],"state_sha256":"6f9afcb5d1dd2f11d0ad01b0de49790e2018e58bbec407549fb5b0891db50382"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5HXIIpgFCKLFeKm9Hv6ShLazk7D8GKpiTuHdd0CRB7N9LIRx97WXMD/CdedUdn3WRI9caUXpn+PdYYBBB41cAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T08:37:23.876746Z","bundle_sha256":"2e6ed33f809e3807d351cf1b2fc1b635e722a510155a2cb7d5813dc1e1b5e5d9"}}