{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:JMSCOKPMHFMWTC4NSG7ZWTUVOG","short_pith_number":"pith:JMSCOKPM","schema_version":"1.0","canonical_sha256":"4b242729ec3959698b8d91bf9b4e9571942d581b3884a731437335b482e9ae06","source":{"kind":"arxiv","id":"1006.0711","version":1},"attestation_state":"computed","paper":{"title":"Optimization of transport protocols with path-length constraints in complex networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.stat-mech","cs.NI"],"primary_cat":"physics.soc-ph","authors_text":"Eduardo Lopez, Jose J. Ramasco, Marta S. de la Lama, Stefan Boettcher","submitted_at":"2010-06-03T18:06:22Z","abstract_excerpt":"We propose a protocol optimization technique that is applicable to both weighted or unweighted graphs. Our aim is to explore by how much a small variation around the Shortest Path or Optimal Path protocols can enhance protocol performance. Such an optimization strategy can be necessary because even though some protocols can achieve very high traffic tolerance levels, this is commonly done by enlarging the path-lengths, which may jeopardize scalability. We use ideas borrowed from Extremal Optimization to guide our algorithm, which proves to be an effective technique. Our method exploits the deg"},"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":"1006.0711","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"physics.soc-ph","submitted_at":"2010-06-03T18:06:22Z","cross_cats_sorted":["cond-mat.stat-mech","cs.NI"],"title_canon_sha256":"faecdff06482721ddee5fad64592903705ceaee43a42486adc5fe30de10a3c46","abstract_canon_sha256":"182df30a40e5d1e8e70e2bd95c9f270ed35a1e279d9fcb4ccd83cdb59a9ceb43"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:07:05.156053Z","signature_b64":"twGv4tzQmGq2W0fm9IfeRbt0DvQQqNkDQADkU/zQrVlgPPOlzMSwDra3UOUJtFSKsScYEbQtnCN3m2Dz+bSFAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4b242729ec3959698b8d91bf9b4e9571942d581b3884a731437335b482e9ae06","last_reissued_at":"2026-05-18T02:07:05.155620Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:07:05.155620Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimization of transport protocols with path-length constraints in complex networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.stat-mech","cs.NI"],"primary_cat":"physics.soc-ph","authors_text":"Eduardo Lopez, Jose J. Ramasco, Marta S. de la Lama, Stefan Boettcher","submitted_at":"2010-06-03T18:06:22Z","abstract_excerpt":"We propose a protocol optimization technique that is applicable to both weighted or unweighted graphs. Our aim is to explore by how much a small variation around the Shortest Path or Optimal Path protocols can enhance protocol performance. Such an optimization strategy can be necessary because even though some protocols can achieve very high traffic tolerance levels, this is commonly done by enlarging the path-lengths, which may jeopardize scalability. We use ideas borrowed from Extremal Optimization to guide our algorithm, which proves to be an effective technique. Our method exploits the deg"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1006.0711","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":"1006.0711","created_at":"2026-05-18T02:07:05.155683+00:00"},{"alias_kind":"arxiv_version","alias_value":"1006.0711v1","created_at":"2026-05-18T02:07:05.155683+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1006.0711","created_at":"2026-05-18T02:07:05.155683+00:00"},{"alias_kind":"pith_short_12","alias_value":"JMSCOKPMHFMW","created_at":"2026-05-18T12:26:09.077623+00:00"},{"alias_kind":"pith_short_16","alias_value":"JMSCOKPMHFMWTC4N","created_at":"2026-05-18T12:26:09.077623+00:00"},{"alias_kind":"pith_short_8","alias_value":"JMSCOKPM","created_at":"2026-05-18T12:26:09.077623+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/JMSCOKPMHFMWTC4NSG7ZWTUVOG","json":"https://pith.science/pith/JMSCOKPMHFMWTC4NSG7ZWTUVOG.json","graph_json":"https://pith.science/api/pith-number/JMSCOKPMHFMWTC4NSG7ZWTUVOG/graph.json","events_json":"https://pith.science/api/pith-number/JMSCOKPMHFMWTC4NSG7ZWTUVOG/events.json","paper":"https://pith.science/paper/JMSCOKPM"},"agent_actions":{"view_html":"https://pith.science/pith/JMSCOKPMHFMWTC4NSG7ZWTUVOG","download_json":"https://pith.science/pith/JMSCOKPMHFMWTC4NSG7ZWTUVOG.json","view_paper":"https://pith.science/paper/JMSCOKPM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1006.0711&json=true","fetch_graph":"https://pith.science/api/pith-number/JMSCOKPMHFMWTC4NSG7ZWTUVOG/graph.json","fetch_events":"https://pith.science/api/pith-number/JMSCOKPMHFMWTC4NSG7ZWTUVOG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JMSCOKPMHFMWTC4NSG7ZWTUVOG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JMSCOKPMHFMWTC4NSG7ZWTUVOG/action/storage_attestation","attest_author":"https://pith.science/pith/JMSCOKPMHFMWTC4NSG7ZWTUVOG/action/author_attestation","sign_citation":"https://pith.science/pith/JMSCOKPMHFMWTC4NSG7ZWTUVOG/action/citation_signature","submit_replication":"https://pith.science/pith/JMSCOKPMHFMWTC4NSG7ZWTUVOG/action/replication_record"}},"created_at":"2026-05-18T02:07:05.155683+00:00","updated_at":"2026-05-18T02:07:05.155683+00:00"}