{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:5HTNBAEIZRZYVH433TN4RBMYJG","short_pith_number":"pith:5HTNBAEI","schema_version":"1.0","canonical_sha256":"e9e6d08088cc738a9f9bdcdbc885984981549475fa4da87215d8a18f992ee362","source":{"kind":"arxiv","id":"1001.4921","version":1},"attestation_state":"computed","paper":{"title":"Optimal Synchronization in Space","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["nlin.CD","nlin.PS"],"primary_cat":"nlin.AO","authors_text":"Markus Brede","submitted_at":"2010-01-27T12:22:07Z","abstract_excerpt":"In this Rapid Communication we investigate spatially constrained networks that realize optimal synchronization properties. After arguing that spatial constraints can be imposed by limiting the amount of `wire' available to connect nodes distributed in space, we use numerical optimization methods to construct networks that realize different trade-offs between optimal synchronization and spatial constraints. Over a large range of parameters such optimal networks are found to have a link length distribution characterized by power law tails $P(l)\\propto l^{-\\alpha}$, with exponents $\\alpha$ increa"},"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":"1001.4921","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"nlin.AO","submitted_at":"2010-01-27T12:22:07Z","cross_cats_sorted":["nlin.CD","nlin.PS"],"title_canon_sha256":"f3f8ff8742e7b987e92fc2e7d1511ed6338f0102498da8b6645c4a3e217603b3","abstract_canon_sha256":"95b93653241108f541865af05d5b7cef694ca5e455e891c96ca10739aaa4835f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:09:29.307447Z","signature_b64":"otZiNWhDvE1rYOmkZvDozP6OMgok3uSGNa++RkTBxgof5QoFLkrhxzO9WQ2PcerFPaINGC4QuyF3XYz9QSSlAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e9e6d08088cc738a9f9bdcdbc885984981549475fa4da87215d8a18f992ee362","last_reissued_at":"2026-05-18T02:09:29.307002Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:09:29.307002Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal Synchronization in Space","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["nlin.CD","nlin.PS"],"primary_cat":"nlin.AO","authors_text":"Markus Brede","submitted_at":"2010-01-27T12:22:07Z","abstract_excerpt":"In this Rapid Communication we investigate spatially constrained networks that realize optimal synchronization properties. After arguing that spatial constraints can be imposed by limiting the amount of `wire' available to connect nodes distributed in space, we use numerical optimization methods to construct networks that realize different trade-offs between optimal synchronization and spatial constraints. Over a large range of parameters such optimal networks are found to have a link length distribution characterized by power law tails $P(l)\\propto l^{-\\alpha}$, with exponents $\\alpha$ increa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1001.4921","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1001.4921","created_at":"2026-05-18T02:09:29.307067+00:00"},{"alias_kind":"arxiv_version","alias_value":"1001.4921v1","created_at":"2026-05-18T02:09:29.307067+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1001.4921","created_at":"2026-05-18T02:09:29.307067+00:00"},{"alias_kind":"pith_short_12","alias_value":"5HTNBAEIZRZY","created_at":"2026-05-18T12:26:04.259169+00:00"},{"alias_kind":"pith_short_16","alias_value":"5HTNBAEIZRZYVH43","created_at":"2026-05-18T12:26:04.259169+00:00"},{"alias_kind":"pith_short_8","alias_value":"5HTNBAEI","created_at":"2026-05-18T12:26:04.259169+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/5HTNBAEIZRZYVH433TN4RBMYJG","json":"https://pith.science/pith/5HTNBAEIZRZYVH433TN4RBMYJG.json","graph_json":"https://pith.science/api/pith-number/5HTNBAEIZRZYVH433TN4RBMYJG/graph.json","events_json":"https://pith.science/api/pith-number/5HTNBAEIZRZYVH433TN4RBMYJG/events.json","paper":"https://pith.science/paper/5HTNBAEI"},"agent_actions":{"view_html":"https://pith.science/pith/5HTNBAEIZRZYVH433TN4RBMYJG","download_json":"https://pith.science/pith/5HTNBAEIZRZYVH433TN4RBMYJG.json","view_paper":"https://pith.science/paper/5HTNBAEI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1001.4921&json=true","fetch_graph":"https://pith.science/api/pith-number/5HTNBAEIZRZYVH433TN4RBMYJG/graph.json","fetch_events":"https://pith.science/api/pith-number/5HTNBAEIZRZYVH433TN4RBMYJG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5HTNBAEIZRZYVH433TN4RBMYJG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5HTNBAEIZRZYVH433TN4RBMYJG/action/storage_attestation","attest_author":"https://pith.science/pith/5HTNBAEIZRZYVH433TN4RBMYJG/action/author_attestation","sign_citation":"https://pith.science/pith/5HTNBAEIZRZYVH433TN4RBMYJG/action/citation_signature","submit_replication":"https://pith.science/pith/5HTNBAEIZRZYVH433TN4RBMYJG/action/replication_record"}},"created_at":"2026-05-18T02:09:29.307067+00:00","updated_at":"2026-05-18T02:09:29.307067+00:00"}