{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:RVOIB7RHBHMUDAACVM2DYHC3XO","short_pith_number":"pith:RVOIB7RH","schema_version":"1.0","canonical_sha256":"8d5c80fe2709d9418002ab343c1c5bbb9e78c8a3da905869cadc4ddc400243f0","source":{"kind":"arxiv","id":"1204.2604","version":1},"attestation_state":"computed","paper":{"title":"The Forwarding Indices of Graphs -- a Survey","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Jun-Ming Xu, Min Xu","submitted_at":"2012-04-12T02:26:47Z","abstract_excerpt":"A routing $R$ of a given connected graph $G$ of order $n$ is a collection of $n(n-1)$ simple paths connecting every ordered pair of vertices of $G$. The vertex-forwarding index $\\xi(G,R)$ of $G$ with respect to $R$ is defined as the maximum number of paths in $R$ passing through any vertex of $G$. The vertex-forwarding index $\\xi(G)$ of $G$ is defined as the minimum $\\xi(G,R)$ over all routing $R$'s of $G$. Similarly, the edge-forwarding index $ \\pi(G,R)$ of $G$ with respect to $R$ is the maximum number of paths in $R$ passing through any edge of $G$. The edge-forwarding index $\\pi(G)$ of $G$ "},"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":"1204.2604","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-04-12T02:26:47Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"98e4bd2fa380aef07b5dc2556b698bb5f96f9e934f7eed69c54f9446c8d84e12","abstract_canon_sha256":"26ba8707a875c1d04357b676526d0f02322c82370fb00672ec5a3429a1e32a8d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:58:03.928841Z","signature_b64":"FLNxjX9/nefwePg3nWkRNSTZdEJqWwnZOxHMQVz1z8oaUCnZ7OeLfd/1Y5L095Rlrxtj9MeIhZNab9LmXjCWAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8d5c80fe2709d9418002ab343c1c5bbb9e78c8a3da905869cadc4ddc400243f0","last_reissued_at":"2026-05-18T03:58:03.928423Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:58:03.928423Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Forwarding Indices of Graphs -- a Survey","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Jun-Ming Xu, Min Xu","submitted_at":"2012-04-12T02:26:47Z","abstract_excerpt":"A routing $R$ of a given connected graph $G$ of order $n$ is a collection of $n(n-1)$ simple paths connecting every ordered pair of vertices of $G$. The vertex-forwarding index $\\xi(G,R)$ of $G$ with respect to $R$ is defined as the maximum number of paths in $R$ passing through any vertex of $G$. The vertex-forwarding index $\\xi(G)$ of $G$ is defined as the minimum $\\xi(G,R)$ over all routing $R$'s of $G$. Similarly, the edge-forwarding index $ \\pi(G,R)$ of $G$ with respect to $R$ is the maximum number of paths in $R$ passing through any edge of $G$. The edge-forwarding index $\\pi(G)$ of $G$ "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.2604","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":"1204.2604","created_at":"2026-05-18T03:58:03.928471+00:00"},{"alias_kind":"arxiv_version","alias_value":"1204.2604v1","created_at":"2026-05-18T03:58:03.928471+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.2604","created_at":"2026-05-18T03:58:03.928471+00:00"},{"alias_kind":"pith_short_12","alias_value":"RVOIB7RHBHMU","created_at":"2026-05-18T12:27:20.899486+00:00"},{"alias_kind":"pith_short_16","alias_value":"RVOIB7RHBHMUDAAC","created_at":"2026-05-18T12:27:20.899486+00:00"},{"alias_kind":"pith_short_8","alias_value":"RVOIB7RH","created_at":"2026-05-18T12:27:20.899486+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/RVOIB7RHBHMUDAACVM2DYHC3XO","json":"https://pith.science/pith/RVOIB7RHBHMUDAACVM2DYHC3XO.json","graph_json":"https://pith.science/api/pith-number/RVOIB7RHBHMUDAACVM2DYHC3XO/graph.json","events_json":"https://pith.science/api/pith-number/RVOIB7RHBHMUDAACVM2DYHC3XO/events.json","paper":"https://pith.science/paper/RVOIB7RH"},"agent_actions":{"view_html":"https://pith.science/pith/RVOIB7RHBHMUDAACVM2DYHC3XO","download_json":"https://pith.science/pith/RVOIB7RHBHMUDAACVM2DYHC3XO.json","view_paper":"https://pith.science/paper/RVOIB7RH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1204.2604&json=true","fetch_graph":"https://pith.science/api/pith-number/RVOIB7RHBHMUDAACVM2DYHC3XO/graph.json","fetch_events":"https://pith.science/api/pith-number/RVOIB7RHBHMUDAACVM2DYHC3XO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RVOIB7RHBHMUDAACVM2DYHC3XO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RVOIB7RHBHMUDAACVM2DYHC3XO/action/storage_attestation","attest_author":"https://pith.science/pith/RVOIB7RHBHMUDAACVM2DYHC3XO/action/author_attestation","sign_citation":"https://pith.science/pith/RVOIB7RHBHMUDAACVM2DYHC3XO/action/citation_signature","submit_replication":"https://pith.science/pith/RVOIB7RHBHMUDAACVM2DYHC3XO/action/replication_record"}},"created_at":"2026-05-18T03:58:03.928471+00:00","updated_at":"2026-05-18T03:58:03.928471+00:00"}