{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:YWE6H7IE7BAI7YSMZQBE3GKDNV","short_pith_number":"pith:YWE6H7IE","canonical_record":{"source":{"id":"1103.0133","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2011-03-01T11:03:23Z","cross_cats_sorted":[],"title_canon_sha256":"1aab65c471e8125def9f61c84b60855e54fce2280aa6ad84de2e199bf36d3dab","abstract_canon_sha256":"834b22eb6a67620f2b0cef56d6db3e1e29f243d0ff6bc23ae53b0f592a270701"},"schema_version":"1.0"},"canonical_sha256":"c589e3fd04f8408fe24ccc024d99436d7e14f308995d0cacf36cd898ab8536fc","source":{"kind":"arxiv","id":"1103.0133","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1103.0133","created_at":"2026-05-18T03:56:24Z"},{"alias_kind":"arxiv_version","alias_value":"1103.0133v2","created_at":"2026-05-18T03:56:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.0133","created_at":"2026-05-18T03:56:24Z"},{"alias_kind":"pith_short_12","alias_value":"YWE6H7IE7BAI","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_16","alias_value":"YWE6H7IE7BAI7YSM","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_8","alias_value":"YWE6H7IE","created_at":"2026-05-18T12:26:47Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:YWE6H7IE7BAI7YSMZQBE3GKDNV","target":"record","payload":{"canonical_record":{"source":{"id":"1103.0133","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2011-03-01T11:03:23Z","cross_cats_sorted":[],"title_canon_sha256":"1aab65c471e8125def9f61c84b60855e54fce2280aa6ad84de2e199bf36d3dab","abstract_canon_sha256":"834b22eb6a67620f2b0cef56d6db3e1e29f243d0ff6bc23ae53b0f592a270701"},"schema_version":"1.0"},"canonical_sha256":"c589e3fd04f8408fe24ccc024d99436d7e14f308995d0cacf36cd898ab8536fc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:56:24.307090Z","signature_b64":"2AVNSA39AVOz/iVDF7/GfeKGPufZ5pSfb/TaACkml8ppg0JS0HZtc7FZm5ARCPLkYiCzsSJvte/pzhSrmLoJDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c589e3fd04f8408fe24ccc024d99436d7e14f308995d0cacf36cd898ab8536fc","last_reissued_at":"2026-05-18T03:56:24.306528Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:56:24.306528Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1103.0133","source_version":2,"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:56:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mvOGJBKlcrE5IBpfjyiUIqaQaoyOgtG/lu3QIThrTVflptVNygKbOd8xKUH2e3UsyX0Va0tx9JGFZgDo78aKDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T07:25:53.862615Z"},"content_sha256":"9e018540724cc56fac81cc7421c419afac086622efcb4806dcdac9b61ea102b3","schema_version":"1.0","event_id":"sha256:9e018540724cc56fac81cc7421c419afac086622efcb4806dcdac9b61ea102b3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:YWE6H7IE7BAI7YSMZQBE3GKDNV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Neighbor Oblivious and Finite-State Algorithms for Circumventing Local Minima in Geographic Forwarding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Anurag Kumar, Chandramani Singh, Malati Hegde, Rajesh Sundaresan, Santosh Ramachandran, S. V. R. Anand","submitted_at":"2011-03-01T11:03:23Z","abstract_excerpt":"We propose distributed link reversal algorithms to circumvent communication voids in geographic routing. We also solve the attendant problem of integer overflow in these algorithms. These are achieved in two steps. First, we derive partial and full link reversal algorithms that do not require one-hop neighbor information, and convert a destination-disoriented directed acyclic graph (DAG) to a destination-oriented DAG. We embed these algorithms in the framework of Gafni and Bertsekas (\"Distributed algorithms for generating loop-free routes in networks with frequently changing topology\", 1981) i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1103.0133","kind":"arxiv","version":2},"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:56:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YRCC1CYj2zL1cr3VsraZEskqR8sYlJoFZrscdN97KWVfrJnblTjIJDargXHIfi+GG8QK6fWju7ImzCRSzY0sBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T07:25:53.862966Z"},"content_sha256":"66275de3f447abe87431348ed305c21f83446ff5284345330ba296bd34cf7423","schema_version":"1.0","event_id":"sha256:66275de3f447abe87431348ed305c21f83446ff5284345330ba296bd34cf7423"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YWE6H7IE7BAI7YSMZQBE3GKDNV/bundle.json","state_url":"https://pith.science/pith/YWE6H7IE7BAI7YSMZQBE3GKDNV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YWE6H7IE7BAI7YSMZQBE3GKDNV/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-02T07:25:53Z","links":{"resolver":"https://pith.science/pith/YWE6H7IE7BAI7YSMZQBE3GKDNV","bundle":"https://pith.science/pith/YWE6H7IE7BAI7YSMZQBE3GKDNV/bundle.json","state":"https://pith.science/pith/YWE6H7IE7BAI7YSMZQBE3GKDNV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YWE6H7IE7BAI7YSMZQBE3GKDNV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:YWE6H7IE7BAI7YSMZQBE3GKDNV","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":"834b22eb6a67620f2b0cef56d6db3e1e29f243d0ff6bc23ae53b0f592a270701","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2011-03-01T11:03:23Z","title_canon_sha256":"1aab65c471e8125def9f61c84b60855e54fce2280aa6ad84de2e199bf36d3dab"},"schema_version":"1.0","source":{"id":"1103.0133","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1103.0133","created_at":"2026-05-18T03:56:24Z"},{"alias_kind":"arxiv_version","alias_value":"1103.0133v2","created_at":"2026-05-18T03:56:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.0133","created_at":"2026-05-18T03:56:24Z"},{"alias_kind":"pith_short_12","alias_value":"YWE6H7IE7BAI","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_16","alias_value":"YWE6H7IE7BAI7YSM","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_8","alias_value":"YWE6H7IE","created_at":"2026-05-18T12:26:47Z"}],"graph_snapshots":[{"event_id":"sha256:66275de3f447abe87431348ed305c21f83446ff5284345330ba296bd34cf7423","target":"graph","created_at":"2026-05-18T03:56:24Z","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 propose distributed link reversal algorithms to circumvent communication voids in geographic routing. We also solve the attendant problem of integer overflow in these algorithms. These are achieved in two steps. First, we derive partial and full link reversal algorithms that do not require one-hop neighbor information, and convert a destination-disoriented directed acyclic graph (DAG) to a destination-oriented DAG. We embed these algorithms in the framework of Gafni and Bertsekas (\"Distributed algorithms for generating loop-free routes in networks with frequently changing topology\", 1981) i","authors_text":"Anurag Kumar, Chandramani Singh, Malati Hegde, Rajesh Sundaresan, Santosh Ramachandran, S. V. R. Anand","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2011-03-01T11:03:23Z","title":"Neighbor Oblivious and Finite-State Algorithms for Circumventing Local Minima in Geographic Forwarding"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1103.0133","kind":"arxiv","version":2},"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:9e018540724cc56fac81cc7421c419afac086622efcb4806dcdac9b61ea102b3","target":"record","created_at":"2026-05-18T03:56:24Z","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":"834b22eb6a67620f2b0cef56d6db3e1e29f243d0ff6bc23ae53b0f592a270701","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2011-03-01T11:03:23Z","title_canon_sha256":"1aab65c471e8125def9f61c84b60855e54fce2280aa6ad84de2e199bf36d3dab"},"schema_version":"1.0","source":{"id":"1103.0133","kind":"arxiv","version":2}},"canonical_sha256":"c589e3fd04f8408fe24ccc024d99436d7e14f308995d0cacf36cd898ab8536fc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c589e3fd04f8408fe24ccc024d99436d7e14f308995d0cacf36cd898ab8536fc","first_computed_at":"2026-05-18T03:56:24.306528Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:56:24.306528Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2AVNSA39AVOz/iVDF7/GfeKGPufZ5pSfb/TaACkml8ppg0JS0HZtc7FZm5ARCPLkYiCzsSJvte/pzhSrmLoJDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:56:24.307090Z","signed_message":"canonical_sha256_bytes"},"source_id":"1103.0133","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9e018540724cc56fac81cc7421c419afac086622efcb4806dcdac9b61ea102b3","sha256:66275de3f447abe87431348ed305c21f83446ff5284345330ba296bd34cf7423"],"state_sha256":"5fb5eec9880de03f4706beaf513318de4f19ad90a13aeccd15c54a79f2e1a164"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Z6ZcNxthxI4xM1QTXz0aO43+uqnZ4+ufxvFNkSGSu3ZSpwFYpXaWRCp9mlIMBluixnyuOLMAH3oTzpP2CfuuCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T07:25:53.864970Z","bundle_sha256":"78c6b8b6f5400daf0caef370376e23d114c19c76a0a23054da0508c4b96f2137"}}