{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:NZ3CMGOG5CGSNI7V6CKBQRIU6Q","short_pith_number":"pith:NZ3CMGOG","canonical_record":{"source":{"id":"1202.0213","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.dis-nn","submitted_at":"2012-02-01T16:56:36Z","cross_cats_sorted":["cond-mat.stat-mech","cs.NI","physics.soc-ph"],"title_canon_sha256":"f9e067a4b6b7cd219123622ac2960ee0ce2f728f2e0a7676db32dfc622ea84bb","abstract_canon_sha256":"581b1b5ded407e2fcf0eabfb961ee96adb34ca5cb7bcab019c6251f243f7b5ea"},"schema_version":"1.0"},"canonical_sha256":"6e762619c6e88d26a3f5f094184514f41797e0ce3f0b8610a05a5583f66abbca","source":{"kind":"arxiv","id":"1202.0213","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1202.0213","created_at":"2026-05-18T03:55:46Z"},{"alias_kind":"arxiv_version","alias_value":"1202.0213v1","created_at":"2026-05-18T03:55:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.0213","created_at":"2026-05-18T03:55:46Z"},{"alias_kind":"pith_short_12","alias_value":"NZ3CMGOG5CGS","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_16","alias_value":"NZ3CMGOG5CGSNI7V","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_8","alias_value":"NZ3CMGOG","created_at":"2026-05-18T12:27:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:NZ3CMGOG5CGSNI7V6CKBQRIU6Q","target":"record","payload":{"canonical_record":{"source":{"id":"1202.0213","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.dis-nn","submitted_at":"2012-02-01T16:56:36Z","cross_cats_sorted":["cond-mat.stat-mech","cs.NI","physics.soc-ph"],"title_canon_sha256":"f9e067a4b6b7cd219123622ac2960ee0ce2f728f2e0a7676db32dfc622ea84bb","abstract_canon_sha256":"581b1b5ded407e2fcf0eabfb961ee96adb34ca5cb7bcab019c6251f243f7b5ea"},"schema_version":"1.0"},"canonical_sha256":"6e762619c6e88d26a3f5f094184514f41797e0ce3f0b8610a05a5583f66abbca","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:55:46.551334Z","signature_b64":"ACyLSGJI6LJ/McKr0Sqe4jUqy/Y85JEKHBb1md635WP1+DYwBr5+v9+sUxookyPf9zgUklWTKVwUaJgMM77DDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6e762619c6e88d26a3f5f094184514f41797e0ce3f0b8610a05a5583f66abbca","last_reissued_at":"2026-05-18T03:55:46.550965Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:55:46.550965Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1202.0213","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-18T03:55:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PpLAT2E8aybhRTAaUA5SFahFFGgcZDn5Y2sTimEjZAwa6eJnzl+JHzZ9WdGnKy9UAwg7Ed/gJypIaznLctQABg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T19:56:34.680576Z"},"content_sha256":"db82fe981ab27728a4f45e494e20de0e68c57775acf7669cc7ff57051506357c","schema_version":"1.0","event_id":"sha256:db82fe981ab27728a4f45e494e20de0e68c57775acf7669cc7ff57051506357c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:NZ3CMGOG5CGSNI7V6CKBQRIU6Q","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Competition for Shortest Paths on Sparse Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.stat-mech","cs.NI","physics.soc-ph"],"primary_cat":"cond-mat.dis-nn","authors_text":"Chi Ho Yeung, David Saad","submitted_at":"2012-02-01T16:56:36Z","abstract_excerpt":"Optimal paths connecting randomly selected network nodes and fixed routers are studied analytically in the presence of non-linear overlap cost that penalizes congestion. Routing becomes increasingly more difficult as the number of selected nodes increases and exhibits ergodicity breaking in the case of multiple routers. A distributed linearly-scalable routing algorithm is devised. The ground state of such systems reveals non-monotonic complex behaviors in both average path-length and algorithmic convergence, depending on the network topology, and densities of communicating nodes and routers."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.0213","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-18T03:55:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xAoTOthotkxF6J4TzD0I6WvikyZa04YQN+N/5WSGDA8A0DGB/Tf05w9LbfE4kyStylsAz5SayMcjo9h9Z6UCAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T19:56:34.680923Z"},"content_sha256":"ff7a165f4cf8b9a282c7a8d078525d7e02774d73b9c6f3ee26f18c00cabcef2f","schema_version":"1.0","event_id":"sha256:ff7a165f4cf8b9a282c7a8d078525d7e02774d73b9c6f3ee26f18c00cabcef2f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NZ3CMGOG5CGSNI7V6CKBQRIU6Q/bundle.json","state_url":"https://pith.science/pith/NZ3CMGOG5CGSNI7V6CKBQRIU6Q/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NZ3CMGOG5CGSNI7V6CKBQRIU6Q/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-10T19:56:34Z","links":{"resolver":"https://pith.science/pith/NZ3CMGOG5CGSNI7V6CKBQRIU6Q","bundle":"https://pith.science/pith/NZ3CMGOG5CGSNI7V6CKBQRIU6Q/bundle.json","state":"https://pith.science/pith/NZ3CMGOG5CGSNI7V6CKBQRIU6Q/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NZ3CMGOG5CGSNI7V6CKBQRIU6Q/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:NZ3CMGOG5CGSNI7V6CKBQRIU6Q","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":"581b1b5ded407e2fcf0eabfb961ee96adb34ca5cb7bcab019c6251f243f7b5ea","cross_cats_sorted":["cond-mat.stat-mech","cs.NI","physics.soc-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.dis-nn","submitted_at":"2012-02-01T16:56:36Z","title_canon_sha256":"f9e067a4b6b7cd219123622ac2960ee0ce2f728f2e0a7676db32dfc622ea84bb"},"schema_version":"1.0","source":{"id":"1202.0213","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1202.0213","created_at":"2026-05-18T03:55:46Z"},{"alias_kind":"arxiv_version","alias_value":"1202.0213v1","created_at":"2026-05-18T03:55:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.0213","created_at":"2026-05-18T03:55:46Z"},{"alias_kind":"pith_short_12","alias_value":"NZ3CMGOG5CGS","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_16","alias_value":"NZ3CMGOG5CGSNI7V","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_8","alias_value":"NZ3CMGOG","created_at":"2026-05-18T12:27:16Z"}],"graph_snapshots":[{"event_id":"sha256:ff7a165f4cf8b9a282c7a8d078525d7e02774d73b9c6f3ee26f18c00cabcef2f","target":"graph","created_at":"2026-05-18T03:55:46Z","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":"Optimal paths connecting randomly selected network nodes and fixed routers are studied analytically in the presence of non-linear overlap cost that penalizes congestion. Routing becomes increasingly more difficult as the number of selected nodes increases and exhibits ergodicity breaking in the case of multiple routers. A distributed linearly-scalable routing algorithm is devised. The ground state of such systems reveals non-monotonic complex behaviors in both average path-length and algorithmic convergence, depending on the network topology, and densities of communicating nodes and routers.","authors_text":"Chi Ho Yeung, David Saad","cross_cats":["cond-mat.stat-mech","cs.NI","physics.soc-ph"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.dis-nn","submitted_at":"2012-02-01T16:56:36Z","title":"The Competition for Shortest Paths on Sparse Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.0213","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:db82fe981ab27728a4f45e494e20de0e68c57775acf7669cc7ff57051506357c","target":"record","created_at":"2026-05-18T03:55:46Z","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":"581b1b5ded407e2fcf0eabfb961ee96adb34ca5cb7bcab019c6251f243f7b5ea","cross_cats_sorted":["cond-mat.stat-mech","cs.NI","physics.soc-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.dis-nn","submitted_at":"2012-02-01T16:56:36Z","title_canon_sha256":"f9e067a4b6b7cd219123622ac2960ee0ce2f728f2e0a7676db32dfc622ea84bb"},"schema_version":"1.0","source":{"id":"1202.0213","kind":"arxiv","version":1}},"canonical_sha256":"6e762619c6e88d26a3f5f094184514f41797e0ce3f0b8610a05a5583f66abbca","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6e762619c6e88d26a3f5f094184514f41797e0ce3f0b8610a05a5583f66abbca","first_computed_at":"2026-05-18T03:55:46.550965Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:55:46.550965Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ACyLSGJI6LJ/McKr0Sqe4jUqy/Y85JEKHBb1md635WP1+DYwBr5+v9+sUxookyPf9zgUklWTKVwUaJgMM77DDg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:55:46.551334Z","signed_message":"canonical_sha256_bytes"},"source_id":"1202.0213","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:db82fe981ab27728a4f45e494e20de0e68c57775acf7669cc7ff57051506357c","sha256:ff7a165f4cf8b9a282c7a8d078525d7e02774d73b9c6f3ee26f18c00cabcef2f"],"state_sha256":"ca455967b0769bdcfe11a3d33bfc0d93f3db9015c886368e236173871df9e23a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lugywbsszDJin3w3DZuB912AcwxaMnwG6M8X++VSusLF3Wjneus4aNf5WtEltaF6k2sRU6m2cFKQQwq2GlXGCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T19:56:34.682855Z","bundle_sha256":"c856be6b45a3769a413769fd7034ad32646bb35befdc09ae4239dd72de2c38df"}}