{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:6GK4I5LX72UG7DHVCU3K5POGXC","short_pith_number":"pith:6GK4I5LX","canonical_record":{"source":{"id":"1203.1905","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2012-03-08T20:20:48Z","cross_cats_sorted":[],"title_canon_sha256":"03c9499f8bb8bc448df4e2fc0983aefcdce42381e5be19779c05b210ea3cd435","abstract_canon_sha256":"fdc7eb7ded139dd4b609c00fd60e5e4b719ce0e95149547d06618798f879d4db"},"schema_version":"1.0"},"canonical_sha256":"f195c47577fea86f8cf51536aebdc6b8ae5c10c8ba233645146a4d89ec08e817","source":{"kind":"arxiv","id":"1203.1905","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1203.1905","created_at":"2026-05-18T03:34:14Z"},{"alias_kind":"arxiv_version","alias_value":"1203.1905v1","created_at":"2026-05-18T03:34:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.1905","created_at":"2026-05-18T03:34:14Z"},{"alias_kind":"pith_short_12","alias_value":"6GK4I5LX72UG","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_16","alias_value":"6GK4I5LX72UG7DHV","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_8","alias_value":"6GK4I5LX","created_at":"2026-05-18T12:26:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:6GK4I5LX72UG7DHVCU3K5POGXC","target":"record","payload":{"canonical_record":{"source":{"id":"1203.1905","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2012-03-08T20:20:48Z","cross_cats_sorted":[],"title_canon_sha256":"03c9499f8bb8bc448df4e2fc0983aefcdce42381e5be19779c05b210ea3cd435","abstract_canon_sha256":"fdc7eb7ded139dd4b609c00fd60e5e4b719ce0e95149547d06618798f879d4db"},"schema_version":"1.0"},"canonical_sha256":"f195c47577fea86f8cf51536aebdc6b8ae5c10c8ba233645146a4d89ec08e817","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:34:14.179915Z","signature_b64":"S1AMnRANAcYCXSjD1sHLreQkp8wYeHJEibIVUay/kp/KvfD+qf2J60Hc0YZbNo5kM73mTi8TZ02punFHLZhRAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f195c47577fea86f8cf51536aebdc6b8ae5c10c8ba233645146a4d89ec08e817","last_reissued_at":"2026-05-18T03:34:14.179060Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:34:14.179060Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1203.1905","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:34:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UBKUWzWeTcF+Wr7claFIRU2MbZPIW5jGDjoYJlKMW4CRPOpS9BUShHeqcnqPcbS+t7PGa3qSiDZhOVR9KjRdBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T07:12:54.408604Z"},"content_sha256":"a2ed511c34d35933ea2915228f658af46379c8d7961ae9297259e335659c3be6","schema_version":"1.0","event_id":"sha256:a2ed511c34d35933ea2915228f658af46379c8d7961ae9297259e335659c3be6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:6GK4I5LX72UG7DHVCU3K5POGXC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Local heuristic for the refinement of multi-path routing in wireless mesh networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Fabio R. J. Vieira, Jos\\'e F. de Rezende, Serge Fdida, Valmir C. Barbosa","submitted_at":"2012-03-08T20:20:48Z","abstract_excerpt":"We consider wireless mesh networks and the problem of routing end-to-end traffic over multiple paths for the same origin-destination pair with minimal interference. We introduce a heuristic for path determination with two distinguishing characteristics. First, it works by refining an extant set of paths, determined previously by a single- or multi-path routing algorithm. Second, it is totally local, in the sense that it can be run by each of the origins on information that is available no farther than the node's immediate neighborhood. We have conducted extensive computational experiments with"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.1905","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:34:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rzy0AbrlE/PyFdMyIOObqNtknjF23U7eOpoLueIhGyNWbRUxBAUO8+5pxnSwFbk1xIJvaKVzB1ep+0uSQwJtCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T07:12:54.408951Z"},"content_sha256":"87ee2b6540bf560e91ad4e1ab0bb2fccb124e596c92c8e15cb0681b5cfc5ff3c","schema_version":"1.0","event_id":"sha256:87ee2b6540bf560e91ad4e1ab0bb2fccb124e596c92c8e15cb0681b5cfc5ff3c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6GK4I5LX72UG7DHVCU3K5POGXC/bundle.json","state_url":"https://pith.science/pith/6GK4I5LX72UG7DHVCU3K5POGXC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6GK4I5LX72UG7DHVCU3K5POGXC/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-22T07:12:54Z","links":{"resolver":"https://pith.science/pith/6GK4I5LX72UG7DHVCU3K5POGXC","bundle":"https://pith.science/pith/6GK4I5LX72UG7DHVCU3K5POGXC/bundle.json","state":"https://pith.science/pith/6GK4I5LX72UG7DHVCU3K5POGXC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6GK4I5LX72UG7DHVCU3K5POGXC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:6GK4I5LX72UG7DHVCU3K5POGXC","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":"fdc7eb7ded139dd4b609c00fd60e5e4b719ce0e95149547d06618798f879d4db","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2012-03-08T20:20:48Z","title_canon_sha256":"03c9499f8bb8bc448df4e2fc0983aefcdce42381e5be19779c05b210ea3cd435"},"schema_version":"1.0","source":{"id":"1203.1905","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1203.1905","created_at":"2026-05-18T03:34:14Z"},{"alias_kind":"arxiv_version","alias_value":"1203.1905v1","created_at":"2026-05-18T03:34:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.1905","created_at":"2026-05-18T03:34:14Z"},{"alias_kind":"pith_short_12","alias_value":"6GK4I5LX72UG","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_16","alias_value":"6GK4I5LX72UG7DHV","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_8","alias_value":"6GK4I5LX","created_at":"2026-05-18T12:26:56Z"}],"graph_snapshots":[{"event_id":"sha256:87ee2b6540bf560e91ad4e1ab0bb2fccb124e596c92c8e15cb0681b5cfc5ff3c","target":"graph","created_at":"2026-05-18T03:34:14Z","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":"We consider wireless mesh networks and the problem of routing end-to-end traffic over multiple paths for the same origin-destination pair with minimal interference. We introduce a heuristic for path determination with two distinguishing characteristics. First, it works by refining an extant set of paths, determined previously by a single- or multi-path routing algorithm. Second, it is totally local, in the sense that it can be run by each of the origins on information that is available no farther than the node's immediate neighborhood. We have conducted extensive computational experiments with","authors_text":"Fabio R. J. Vieira, Jos\\'e F. de Rezende, Serge Fdida, Valmir C. Barbosa","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2012-03-08T20:20:48Z","title":"Local heuristic for the refinement of multi-path routing in wireless mesh networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.1905","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:a2ed511c34d35933ea2915228f658af46379c8d7961ae9297259e335659c3be6","target":"record","created_at":"2026-05-18T03:34:14Z","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":"fdc7eb7ded139dd4b609c00fd60e5e4b719ce0e95149547d06618798f879d4db","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2012-03-08T20:20:48Z","title_canon_sha256":"03c9499f8bb8bc448df4e2fc0983aefcdce42381e5be19779c05b210ea3cd435"},"schema_version":"1.0","source":{"id":"1203.1905","kind":"arxiv","version":1}},"canonical_sha256":"f195c47577fea86f8cf51536aebdc6b8ae5c10c8ba233645146a4d89ec08e817","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f195c47577fea86f8cf51536aebdc6b8ae5c10c8ba233645146a4d89ec08e817","first_computed_at":"2026-05-18T03:34:14.179060Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:34:14.179060Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"S1AMnRANAcYCXSjD1sHLreQkp8wYeHJEibIVUay/kp/KvfD+qf2J60Hc0YZbNo5kM73mTi8TZ02punFHLZhRAA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:34:14.179915Z","signed_message":"canonical_sha256_bytes"},"source_id":"1203.1905","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a2ed511c34d35933ea2915228f658af46379c8d7961ae9297259e335659c3be6","sha256:87ee2b6540bf560e91ad4e1ab0bb2fccb124e596c92c8e15cb0681b5cfc5ff3c"],"state_sha256":"6cec9ee15a2cfbf6dbcefefc5e373b1e3b13bc151a2511e0d44bc2089e2524d6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ENWIILeiVquyqju0jw18eC6jkhBxCk+bQDa2bUNn1iXtq48xC1YxuMcqP+ORe8CX1ugPsT6RNDOpz9TIDbZIAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T07:12:54.410941Z","bundle_sha256":"e9bb8b9b3d158a1033ddd109d87ac708dc2dfbe24a759a9ab15c2f3cbc26bcda"}}