{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:2SGN6MDT526PEUICCBVJ7GR6SW","short_pith_number":"pith:2SGN6MDT","schema_version":"1.0","canonical_sha256":"d48cdf3073eebcf25102106a9f9a3e95b04b5e0d64c6266acb10b93492a6f7de","source":{"kind":"arxiv","id":"1512.06532","version":1},"attestation_state":"computed","paper":{"title":"Path computation in multi-layer multi-domain networks: A language theoretic approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.FL","cs.NI"],"primary_cat":"cs.DS","authors_text":"Dominique Barth (PRISM), H\\'elia Pouyllau, Mohamed Lamine Lamali","submitted_at":"2015-12-21T08:55:41Z","abstract_excerpt":"Multi-layer networks are networks in which several protocols may coexist at different layers. The Pseudo-Wire architecture provides encapsulation and de-capsulation functions of protocols over Packet-Switched Networks. In a multi-domain context, computing a path to support end-to-end services requires the consideration of encapsulation and decapsulation capabilities. It appears that graph models are not expressive enough to tackle this problem. In this paper, we propose a new model of heterogeneous networks using Automata Theory. A network is modeled as a Push-Down Automaton (PDA) which is abl"},"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":"1512.06532","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-12-21T08:55:41Z","cross_cats_sorted":["cs.FL","cs.NI"],"title_canon_sha256":"650f43f59f1badb2e1fbc13a1c30ca66d5edf9cd18cddf5a67f985fc7288a8d6","abstract_canon_sha256":"8a03fc2d80c11b4fd684e7ee0fb2930200910c999c7860d9b1a5f2543fa522fd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:24:00.291747Z","signature_b64":"V6Fjb2kqoybAYOB/OD1ekEqN5pHL8SCr5k0+VZWjXLTYE8hzUhtLxcDJ9Rix9tSm1yx5RWddj+rX4hGv3VSnDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d48cdf3073eebcf25102106a9f9a3e95b04b5e0d64c6266acb10b93492a6f7de","last_reissued_at":"2026-05-18T01:24:00.290985Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:24:00.290985Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Path computation in multi-layer multi-domain networks: A language theoretic approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.FL","cs.NI"],"primary_cat":"cs.DS","authors_text":"Dominique Barth (PRISM), H\\'elia Pouyllau, Mohamed Lamine Lamali","submitted_at":"2015-12-21T08:55:41Z","abstract_excerpt":"Multi-layer networks are networks in which several protocols may coexist at different layers. The Pseudo-Wire architecture provides encapsulation and de-capsulation functions of protocols over Packet-Switched Networks. In a multi-domain context, computing a path to support end-to-end services requires the consideration of encapsulation and decapsulation capabilities. It appears that graph models are not expressive enough to tackle this problem. In this paper, we propose a new model of heterogeneous networks using Automata Theory. A network is modeled as a Push-Down Automaton (PDA) which is abl"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.06532","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":"1512.06532","created_at":"2026-05-18T01:24:00.291111+00:00"},{"alias_kind":"arxiv_version","alias_value":"1512.06532v1","created_at":"2026-05-18T01:24:00.291111+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.06532","created_at":"2026-05-18T01:24:00.291111+00:00"},{"alias_kind":"pith_short_12","alias_value":"2SGN6MDT526P","created_at":"2026-05-18T12:29:02.477457+00:00"},{"alias_kind":"pith_short_16","alias_value":"2SGN6MDT526PEUIC","created_at":"2026-05-18T12:29:02.477457+00:00"},{"alias_kind":"pith_short_8","alias_value":"2SGN6MDT","created_at":"2026-05-18T12:29:02.477457+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/2SGN6MDT526PEUICCBVJ7GR6SW","json":"https://pith.science/pith/2SGN6MDT526PEUICCBVJ7GR6SW.json","graph_json":"https://pith.science/api/pith-number/2SGN6MDT526PEUICCBVJ7GR6SW/graph.json","events_json":"https://pith.science/api/pith-number/2SGN6MDT526PEUICCBVJ7GR6SW/events.json","paper":"https://pith.science/paper/2SGN6MDT"},"agent_actions":{"view_html":"https://pith.science/pith/2SGN6MDT526PEUICCBVJ7GR6SW","download_json":"https://pith.science/pith/2SGN6MDT526PEUICCBVJ7GR6SW.json","view_paper":"https://pith.science/paper/2SGN6MDT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1512.06532&json=true","fetch_graph":"https://pith.science/api/pith-number/2SGN6MDT526PEUICCBVJ7GR6SW/graph.json","fetch_events":"https://pith.science/api/pith-number/2SGN6MDT526PEUICCBVJ7GR6SW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2SGN6MDT526PEUICCBVJ7GR6SW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2SGN6MDT526PEUICCBVJ7GR6SW/action/storage_attestation","attest_author":"https://pith.science/pith/2SGN6MDT526PEUICCBVJ7GR6SW/action/author_attestation","sign_citation":"https://pith.science/pith/2SGN6MDT526PEUICCBVJ7GR6SW/action/citation_signature","submit_replication":"https://pith.science/pith/2SGN6MDT526PEUICCBVJ7GR6SW/action/replication_record"}},"created_at":"2026-05-18T01:24:00.291111+00:00","updated_at":"2026-05-18T01:24:00.291111+00:00"}