{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:MXE7UILJ5E6ITDMVWFAPOHKEBF","short_pith_number":"pith:MXE7UILJ","schema_version":"1.0","canonical_sha256":"65c9fa2169e93c898d95b140f71d44094792b539b4443634e4bfb719b180c364","source":{"kind":"arxiv","id":"1710.08665","version":1},"attestation_state":"computed","paper":{"title":"REPETITA: Repeatable Experiments for Performance Evaluation of Traffic-Engineering Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Pierre Schaus, Stefano Vissicchio, Steven Gay","submitted_at":"2017-10-24T09:13:27Z","abstract_excerpt":"In this paper, we propose a pragmatic approach to improve reproducibility of experimental analyses of traffic engineering (TE) algorithms, whose implementation, evaluation and comparison are currently hard to replicate. Our envisioned goal is to enable universally-checkable experiments of existing and future TE algorithms. We describe the design and implementation of REPETITA, a software framework that implements common TE functions, automates experimental setup, and eases comparisons (in terms of solution quality, execution time, etc.) of TE algorithms. In its current version, REPETITA includ"},"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":"1710.08665","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2017-10-24T09:13:27Z","cross_cats_sorted":[],"title_canon_sha256":"517bf8e9ba6b6f31dde7616584c096005fb5532cc28a5ff8164de2f28ef01890","abstract_canon_sha256":"af0640a83f6d820e9484effb1a376d5f7c960c4eb27c5115750c586fe92712e5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:32:04.152641Z","signature_b64":"XbSssqGpenB0diqgHWVOlC2ufrvyDGLqED/axWNfgkanaiERN9wjl2VB/O7tGJT00z+yAq9+OkW4COMnwtciDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"65c9fa2169e93c898d95b140f71d44094792b539b4443634e4bfb719b180c364","last_reissued_at":"2026-05-18T00:32:04.151781Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:32:04.151781Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"REPETITA: Repeatable Experiments for Performance Evaluation of Traffic-Engineering Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Pierre Schaus, Stefano Vissicchio, Steven Gay","submitted_at":"2017-10-24T09:13:27Z","abstract_excerpt":"In this paper, we propose a pragmatic approach to improve reproducibility of experimental analyses of traffic engineering (TE) algorithms, whose implementation, evaluation and comparison are currently hard to replicate. Our envisioned goal is to enable universally-checkable experiments of existing and future TE algorithms. We describe the design and implementation of REPETITA, a software framework that implements common TE functions, automates experimental setup, and eases comparisons (in terms of solution quality, execution time, etc.) of TE algorithms. In its current version, REPETITA includ"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.08665","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":"1710.08665","created_at":"2026-05-18T00:32:04.151934+00:00"},{"alias_kind":"arxiv_version","alias_value":"1710.08665v1","created_at":"2026-05-18T00:32:04.151934+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.08665","created_at":"2026-05-18T00:32:04.151934+00:00"},{"alias_kind":"pith_short_12","alias_value":"MXE7UILJ5E6I","created_at":"2026-05-18T12:31:31.346846+00:00"},{"alias_kind":"pith_short_16","alias_value":"MXE7UILJ5E6ITDMV","created_at":"2026-05-18T12:31:31.346846+00:00"},{"alias_kind":"pith_short_8","alias_value":"MXE7UILJ","created_at":"2026-05-18T12:31:31.346846+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.06319","citing_title":"Designing Capacitated Subnetworks for Shortest Path Routing","ref_index":107,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/MXE7UILJ5E6ITDMVWFAPOHKEBF","json":"https://pith.science/pith/MXE7UILJ5E6ITDMVWFAPOHKEBF.json","graph_json":"https://pith.science/api/pith-number/MXE7UILJ5E6ITDMVWFAPOHKEBF/graph.json","events_json":"https://pith.science/api/pith-number/MXE7UILJ5E6ITDMVWFAPOHKEBF/events.json","paper":"https://pith.science/paper/MXE7UILJ"},"agent_actions":{"view_html":"https://pith.science/pith/MXE7UILJ5E6ITDMVWFAPOHKEBF","download_json":"https://pith.science/pith/MXE7UILJ5E6ITDMVWFAPOHKEBF.json","view_paper":"https://pith.science/paper/MXE7UILJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1710.08665&json=true","fetch_graph":"https://pith.science/api/pith-number/MXE7UILJ5E6ITDMVWFAPOHKEBF/graph.json","fetch_events":"https://pith.science/api/pith-number/MXE7UILJ5E6ITDMVWFAPOHKEBF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MXE7UILJ5E6ITDMVWFAPOHKEBF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MXE7UILJ5E6ITDMVWFAPOHKEBF/action/storage_attestation","attest_author":"https://pith.science/pith/MXE7UILJ5E6ITDMVWFAPOHKEBF/action/author_attestation","sign_citation":"https://pith.science/pith/MXE7UILJ5E6ITDMVWFAPOHKEBF/action/citation_signature","submit_replication":"https://pith.science/pith/MXE7UILJ5E6ITDMVWFAPOHKEBF/action/replication_record"}},"created_at":"2026-05-18T00:32:04.151934+00:00","updated_at":"2026-05-18T00:32:04.151934+00:00"}