{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:4LKVC2C3DJ7JOWYWLIECDCOBZH","short_pith_number":"pith:4LKVC2C3","schema_version":"1.0","canonical_sha256":"e2d551685b1a7e975b165a082189c1c9ff83931b49312464cc6008e3324cbc03","source":{"kind":"arxiv","id":"1304.7687","version":2},"attestation_state":"computed","paper":{"title":"A Nonmonotone Analysis with the Primal-Dual Approach: online routing of virtual circuits with unknown durations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Guy Even, Moti Medina","submitted_at":"2013-04-29T15:36:35Z","abstract_excerpt":"We address the question of whether the primal-dual approach for the design and analysis of online algorithms can be applied to nonmonotone problems. We provide a positive answer by presenting a primal-dual analysis to the online algorithm of Awerbuch et al.[AAPW01] for routing virtual circuits with unknown durations."},"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":"1304.7687","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-04-29T15:36:35Z","cross_cats_sorted":[],"title_canon_sha256":"dbdaa5acb9615c33a90d9b765b299219cc1aa4fb5974bbc0dfde1037bc16069b","abstract_canon_sha256":"c26c842d74a0fb54fd058dd49c6a684f0cec6c7b80bcb3807b0dada017b4684c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:21:23.401331Z","signature_b64":"tVtW/BoKtNofMb9J30fBdEK8jTEGSUFFTT3rY4gZDmuL/ixzRTZBvkR9W1i6dSk18omMvKpmauUNf1DsV5XMDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e2d551685b1a7e975b165a082189c1c9ff83931b49312464cc6008e3324cbc03","last_reissued_at":"2026-05-18T03:21:23.400806Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:21:23.400806Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Nonmonotone Analysis with the Primal-Dual Approach: online routing of virtual circuits with unknown durations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Guy Even, Moti Medina","submitted_at":"2013-04-29T15:36:35Z","abstract_excerpt":"We address the question of whether the primal-dual approach for the design and analysis of online algorithms can be applied to nonmonotone problems. We provide a positive answer by presenting a primal-dual analysis to the online algorithm of Awerbuch et al.[AAPW01] for routing virtual circuits with unknown durations."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.7687","kind":"arxiv","version":2},"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":"1304.7687","created_at":"2026-05-18T03:21:23.400884+00:00"},{"alias_kind":"arxiv_version","alias_value":"1304.7687v2","created_at":"2026-05-18T03:21:23.400884+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.7687","created_at":"2026-05-18T03:21:23.400884+00:00"},{"alias_kind":"pith_short_12","alias_value":"4LKVC2C3DJ7J","created_at":"2026-05-18T12:27:34.582898+00:00"},{"alias_kind":"pith_short_16","alias_value":"4LKVC2C3DJ7JOWYW","created_at":"2026-05-18T12:27:34.582898+00:00"},{"alias_kind":"pith_short_8","alias_value":"4LKVC2C3","created_at":"2026-05-18T12:27:34.582898+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/4LKVC2C3DJ7JOWYWLIECDCOBZH","json":"https://pith.science/pith/4LKVC2C3DJ7JOWYWLIECDCOBZH.json","graph_json":"https://pith.science/api/pith-number/4LKVC2C3DJ7JOWYWLIECDCOBZH/graph.json","events_json":"https://pith.science/api/pith-number/4LKVC2C3DJ7JOWYWLIECDCOBZH/events.json","paper":"https://pith.science/paper/4LKVC2C3"},"agent_actions":{"view_html":"https://pith.science/pith/4LKVC2C3DJ7JOWYWLIECDCOBZH","download_json":"https://pith.science/pith/4LKVC2C3DJ7JOWYWLIECDCOBZH.json","view_paper":"https://pith.science/paper/4LKVC2C3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1304.7687&json=true","fetch_graph":"https://pith.science/api/pith-number/4LKVC2C3DJ7JOWYWLIECDCOBZH/graph.json","fetch_events":"https://pith.science/api/pith-number/4LKVC2C3DJ7JOWYWLIECDCOBZH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4LKVC2C3DJ7JOWYWLIECDCOBZH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4LKVC2C3DJ7JOWYWLIECDCOBZH/action/storage_attestation","attest_author":"https://pith.science/pith/4LKVC2C3DJ7JOWYWLIECDCOBZH/action/author_attestation","sign_citation":"https://pith.science/pith/4LKVC2C3DJ7JOWYWLIECDCOBZH/action/citation_signature","submit_replication":"https://pith.science/pith/4LKVC2C3DJ7JOWYWLIECDCOBZH/action/replication_record"}},"created_at":"2026-05-18T03:21:23.400884+00:00","updated_at":"2026-05-18T03:21:23.400884+00:00"}