{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:OIRWS66KNRXZABTYJUKRCKFXHU","short_pith_number":"pith:OIRWS66K","canonical_record":{"source":{"id":"1202.6109","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2012-02-28T03:30:22Z","cross_cats_sorted":["math.AT"],"title_canon_sha256":"4daad00e86b35507686a2534e553b0db0d24a4b70a77fff66e6ebcb8859172ef","abstract_canon_sha256":"a953dd2197d1841f3ff04b40a43edb65f04bfd1ce247cb1d0a38fee549cbe2c5"},"schema_version":"1.0"},"canonical_sha256":"7223697bca6c6f9006784d151128b73d261345166de3115f6aed0c1e048f46c3","source":{"kind":"arxiv","id":"1202.6109","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1202.6109","created_at":"2026-05-18T04:01:23Z"},{"alias_kind":"arxiv_version","alias_value":"1202.6109v1","created_at":"2026-05-18T04:01:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.6109","created_at":"2026-05-18T04:01:23Z"},{"alias_kind":"pith_short_12","alias_value":"OIRWS66KNRXZ","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_16","alias_value":"OIRWS66KNRXZABTY","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_8","alias_value":"OIRWS66K","created_at":"2026-05-18T12:27:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:OIRWS66KNRXZABTYJUKRCKFXHU","target":"record","payload":{"canonical_record":{"source":{"id":"1202.6109","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2012-02-28T03:30:22Z","cross_cats_sorted":["math.AT"],"title_canon_sha256":"4daad00e86b35507686a2534e553b0db0d24a4b70a77fff66e6ebcb8859172ef","abstract_canon_sha256":"a953dd2197d1841f3ff04b40a43edb65f04bfd1ce247cb1d0a38fee549cbe2c5"},"schema_version":"1.0"},"canonical_sha256":"7223697bca6c6f9006784d151128b73d261345166de3115f6aed0c1e048f46c3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:01:23.563781Z","signature_b64":"RTaiBAtSJAuIZPHP6Ga/ueo7KRAoLWZEoZT4Iqu/hIeOnvwrbO5Hcnja6vc7kcfdQtiXokHbntSxlYk+0EMcDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7223697bca6c6f9006784d151128b73d261345166de3115f6aed0c1e048f46c3","last_reissued_at":"2026-05-18T04:01:23.563267Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:01:23.563267Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1202.6109","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-18T04:01:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"w/WVHC64EjawB6/2ClXh0K4Nng2q0M8+C8BSYCrULZ7RSSjYJskXQg9LDIjTq/K6gScKavRCtVSPbmI0M8n/DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T17:58:09.832681Z"},"content_sha256":"c3f9fee794e23186ae54af8de498e01a81c9f4ef48384926df38fd708459286e","schema_version":"1.0","event_id":"sha256:c3f9fee794e23186ae54af8de498e01a81c9f4ef48384926df38fd708459286e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:OIRWS66KNRXZABTYJUKRCKFXHU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Local Routing in Graphs Embedded on Surfaces of Arbitrary Genus","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.AT"],"primary_cat":"cs.CG","authors_text":"Maia Fraser","submitted_at":"2012-02-28T03:30:22Z","abstract_excerpt":"We present a local routing algorithm which guarantees delivery in all connected graphs embedded on a known surface of genus $g$. The algorithm transports $O(g\\log n)$ memory and finishes in time $O(g^2n^2)$, where $n$ is the size of the graph. It requires access to a homology basis for the surface. This algorithm, GFR, may be viewed as a suitable generalization of Face Routing (FR), the well-known algorithm for plane graphs, which we previously showed does {\\it not} guarantee delivery in graphs embedded on positive genus surfaces. The problem for such surfaces is the potential presence of homo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.6109","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-18T04:01:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JGCG6RemdkIVkzFLq3pRqAKeB8bTHgpf5D0BlyQlhjhGeA0KisaY+ZMRkQF8L0EcUoN7fmS2ykwEgfXOgkbHCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T17:58:09.833359Z"},"content_sha256":"e355c224699845261d70d4a59b38cd1d116eb9fdaadf023454bc309870757aee","schema_version":"1.0","event_id":"sha256:e355c224699845261d70d4a59b38cd1d116eb9fdaadf023454bc309870757aee"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OIRWS66KNRXZABTYJUKRCKFXHU/bundle.json","state_url":"https://pith.science/pith/OIRWS66KNRXZABTYJUKRCKFXHU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OIRWS66KNRXZABTYJUKRCKFXHU/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-05-28T17:58:09Z","links":{"resolver":"https://pith.science/pith/OIRWS66KNRXZABTYJUKRCKFXHU","bundle":"https://pith.science/pith/OIRWS66KNRXZABTYJUKRCKFXHU/bundle.json","state":"https://pith.science/pith/OIRWS66KNRXZABTYJUKRCKFXHU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OIRWS66KNRXZABTYJUKRCKFXHU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:OIRWS66KNRXZABTYJUKRCKFXHU","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":"a953dd2197d1841f3ff04b40a43edb65f04bfd1ce247cb1d0a38fee549cbe2c5","cross_cats_sorted":["math.AT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2012-02-28T03:30:22Z","title_canon_sha256":"4daad00e86b35507686a2534e553b0db0d24a4b70a77fff66e6ebcb8859172ef"},"schema_version":"1.0","source":{"id":"1202.6109","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1202.6109","created_at":"2026-05-18T04:01:23Z"},{"alias_kind":"arxiv_version","alias_value":"1202.6109v1","created_at":"2026-05-18T04:01:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.6109","created_at":"2026-05-18T04:01:23Z"},{"alias_kind":"pith_short_12","alias_value":"OIRWS66KNRXZ","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_16","alias_value":"OIRWS66KNRXZABTY","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_8","alias_value":"OIRWS66K","created_at":"2026-05-18T12:27:16Z"}],"graph_snapshots":[{"event_id":"sha256:e355c224699845261d70d4a59b38cd1d116eb9fdaadf023454bc309870757aee","target":"graph","created_at":"2026-05-18T04:01:23Z","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 present a local routing algorithm which guarantees delivery in all connected graphs embedded on a known surface of genus $g$. The algorithm transports $O(g\\log n)$ memory and finishes in time $O(g^2n^2)$, where $n$ is the size of the graph. It requires access to a homology basis for the surface. This algorithm, GFR, may be viewed as a suitable generalization of Face Routing (FR), the well-known algorithm for plane graphs, which we previously showed does {\\it not} guarantee delivery in graphs embedded on positive genus surfaces. The problem for such surfaces is the potential presence of homo","authors_text":"Maia Fraser","cross_cats":["math.AT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2012-02-28T03:30:22Z","title":"Local Routing in Graphs Embedded on Surfaces of Arbitrary Genus"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.6109","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:c3f9fee794e23186ae54af8de498e01a81c9f4ef48384926df38fd708459286e","target":"record","created_at":"2026-05-18T04:01:23Z","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":"a953dd2197d1841f3ff04b40a43edb65f04bfd1ce247cb1d0a38fee549cbe2c5","cross_cats_sorted":["math.AT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2012-02-28T03:30:22Z","title_canon_sha256":"4daad00e86b35507686a2534e553b0db0d24a4b70a77fff66e6ebcb8859172ef"},"schema_version":"1.0","source":{"id":"1202.6109","kind":"arxiv","version":1}},"canonical_sha256":"7223697bca6c6f9006784d151128b73d261345166de3115f6aed0c1e048f46c3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7223697bca6c6f9006784d151128b73d261345166de3115f6aed0c1e048f46c3","first_computed_at":"2026-05-18T04:01:23.563267Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:01:23.563267Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"RTaiBAtSJAuIZPHP6Ga/ueo7KRAoLWZEoZT4Iqu/hIeOnvwrbO5Hcnja6vc7kcfdQtiXokHbntSxlYk+0EMcDg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:01:23.563781Z","signed_message":"canonical_sha256_bytes"},"source_id":"1202.6109","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c3f9fee794e23186ae54af8de498e01a81c9f4ef48384926df38fd708459286e","sha256:e355c224699845261d70d4a59b38cd1d116eb9fdaadf023454bc309870757aee"],"state_sha256":"637f9cdd30e94c3fb6523862fb33e83a4f91aaa6b9350e67ff7ba1f0280280a5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IwYIMqwT1W6/x8yEOe0fun61y+RsdjPHm2OGnif3Lq5I6qATiNNNwd8+gH/swqGrivIuTiv1aO+rR8PQaMtGAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T17:58:09.836792Z","bundle_sha256":"65277b2dbbcb6e2413898503834bf19fc47150343989cce8edf0abfa605ad2a1"}}