{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:C6E6ALBBPPPDBKCMRDZJU35FM4","short_pith_number":"pith:C6E6ALBB","schema_version":"1.0","canonical_sha256":"1789e02c217bde30a84c88f29a6fa567103c9266f734c75c8185dbda82a7fad6","source":{"kind":"arxiv","id":"1202.4160","version":4},"attestation_state":"computed","paper":{"title":"Interval Routing Schemes for Circular-Arc Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Frank Gurski, Patrick Gwydion Poullie","submitted_at":"2012-02-19T15:33:15Z","abstract_excerpt":"Interval routing is a space efficient method to realize a distributed routing function. In this paper we show that every circular-arc graph allows a shortest path strict 2-interval routing scheme, i.e., by introducing a global order on the vertices and assigning at most two (strict) intervals in this order to the ends of every edge allows to depict a routing function that implies exclusively shortest paths. Since circular-arc graphs do not allow shortest path 1-interval routing schemes in general, the result implies that the class of circular-arc graphs has strict compactness 2, which was a hi"},"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":"1202.4160","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-02-19T15:33:15Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"cd17b35acf1241338c231d43bb5f682ff5577049bda50586f091129627653390","abstract_canon_sha256":"287831da76db195c4f3e3efa043da0b154d47b332f2eb6af868e4880522373f9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:11:55.579364Z","signature_b64":"cdTj54URDivyHa/W0MPm8vv556l+koORtM0NYDOT1fsuVcBGbvWcdi/yAmnxx2Mkp30rs89349Sv3Z10m+g1DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1789e02c217bde30a84c88f29a6fa567103c9266f734c75c8185dbda82a7fad6","last_reissued_at":"2026-05-18T01:11:55.579028Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:11:55.579028Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Interval Routing Schemes for Circular-Arc Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Frank Gurski, Patrick Gwydion Poullie","submitted_at":"2012-02-19T15:33:15Z","abstract_excerpt":"Interval routing is a space efficient method to realize a distributed routing function. In this paper we show that every circular-arc graph allows a shortest path strict 2-interval routing scheme, i.e., by introducing a global order on the vertices and assigning at most two (strict) intervals in this order to the ends of every edge allows to depict a routing function that implies exclusively shortest paths. Since circular-arc graphs do not allow shortest path 1-interval routing schemes in general, the result implies that the class of circular-arc graphs has strict compactness 2, which was a hi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.4160","kind":"arxiv","version":4},"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":"1202.4160","created_at":"2026-05-18T01:11:55.579082+00:00"},{"alias_kind":"arxiv_version","alias_value":"1202.4160v4","created_at":"2026-05-18T01:11:55.579082+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.4160","created_at":"2026-05-18T01:11:55.579082+00:00"},{"alias_kind":"pith_short_12","alias_value":"C6E6ALBBPPPD","created_at":"2026-05-18T12:27:01.376967+00:00"},{"alias_kind":"pith_short_16","alias_value":"C6E6ALBBPPPDBKCM","created_at":"2026-05-18T12:27:01.376967+00:00"},{"alias_kind":"pith_short_8","alias_value":"C6E6ALBB","created_at":"2026-05-18T12:27:01.376967+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/C6E6ALBBPPPDBKCMRDZJU35FM4","json":"https://pith.science/pith/C6E6ALBBPPPDBKCMRDZJU35FM4.json","graph_json":"https://pith.science/api/pith-number/C6E6ALBBPPPDBKCMRDZJU35FM4/graph.json","events_json":"https://pith.science/api/pith-number/C6E6ALBBPPPDBKCMRDZJU35FM4/events.json","paper":"https://pith.science/paper/C6E6ALBB"},"agent_actions":{"view_html":"https://pith.science/pith/C6E6ALBBPPPDBKCMRDZJU35FM4","download_json":"https://pith.science/pith/C6E6ALBBPPPDBKCMRDZJU35FM4.json","view_paper":"https://pith.science/paper/C6E6ALBB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1202.4160&json=true","fetch_graph":"https://pith.science/api/pith-number/C6E6ALBBPPPDBKCMRDZJU35FM4/graph.json","fetch_events":"https://pith.science/api/pith-number/C6E6ALBBPPPDBKCMRDZJU35FM4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/C6E6ALBBPPPDBKCMRDZJU35FM4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/C6E6ALBBPPPDBKCMRDZJU35FM4/action/storage_attestation","attest_author":"https://pith.science/pith/C6E6ALBBPPPDBKCMRDZJU35FM4/action/author_attestation","sign_citation":"https://pith.science/pith/C6E6ALBBPPPDBKCMRDZJU35FM4/action/citation_signature","submit_replication":"https://pith.science/pith/C6E6ALBBPPPDBKCMRDZJU35FM4/action/replication_record"}},"created_at":"2026-05-18T01:11:55.579082+00:00","updated_at":"2026-05-18T01:11:55.579082+00:00"}