{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:56UEKPRS4W3H3GQ6APWGJS6FLB","short_pith_number":"pith:56UEKPRS","schema_version":"1.0","canonical_sha256":"efa8453e32e5b67d9a1e03ec64cbc55874385bc3d48eba1610679ebda16aac0f","source":{"kind":"arxiv","id":"1606.03560","version":9},"attestation_state":"computed","paper":{"title":"Efficient numerical methods for searching equillibriums in large transport networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Alexander Gasnikov","submitted_at":"2016-06-11T06:44:59Z","abstract_excerpt":"We propose new variational principles for traffic assignment problems. So to find equillibrium we have to solve large-scale convex optimization problem of special type. We propose some kind of \"algebra\" on different models and corresponding numerical algorithms that allows us to combine the optimal method from the basis ones and predescribed operations on methods."},"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":"1606.03560","kind":"arxiv","version":9},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-06-11T06:44:59Z","cross_cats_sorted":[],"title_canon_sha256":"eacb46b61f689d0fe03b4dcc53bfd9fcc5259ad0bec6d3e1cc67245b1430c2c4","abstract_canon_sha256":"3e960a8a3428b4e354ac7ea4f7f855446aeb642fa1e1169a82a4eee202f70c70"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:50:01.197262Z","signature_b64":"7W+jNdbi9V3aWJQQVUbv8WszXXrc5Heo6UscW1h044npIpCxWL1bT/vpHJTj0kAB1c/M57Y15vqLBncFiUe4Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"efa8453e32e5b67d9a1e03ec64cbc55874385bc3d48eba1610679ebda16aac0f","last_reissued_at":"2026-05-18T00:50:01.196573Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:50:01.196573Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient numerical methods for searching equillibriums in large transport networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Alexander Gasnikov","submitted_at":"2016-06-11T06:44:59Z","abstract_excerpt":"We propose new variational principles for traffic assignment problems. So to find equillibrium we have to solve large-scale convex optimization problem of special type. We propose some kind of \"algebra\" on different models and corresponding numerical algorithms that allows us to combine the optimal method from the basis ones and predescribed operations on methods."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.03560","kind":"arxiv","version":9},"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":"1606.03560","created_at":"2026-05-18T00:50:01.196686+00:00"},{"alias_kind":"arxiv_version","alias_value":"1606.03560v9","created_at":"2026-05-18T00:50:01.196686+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.03560","created_at":"2026-05-18T00:50:01.196686+00:00"},{"alias_kind":"pith_short_12","alias_value":"56UEKPRS4W3H","created_at":"2026-05-18T12:29:58.707656+00:00"},{"alias_kind":"pith_short_16","alias_value":"56UEKPRS4W3H3GQ6","created_at":"2026-05-18T12:29:58.707656+00:00"},{"alias_kind":"pith_short_8","alias_value":"56UEKPRS","created_at":"2026-05-18T12:29:58.707656+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/56UEKPRS4W3H3GQ6APWGJS6FLB","json":"https://pith.science/pith/56UEKPRS4W3H3GQ6APWGJS6FLB.json","graph_json":"https://pith.science/api/pith-number/56UEKPRS4W3H3GQ6APWGJS6FLB/graph.json","events_json":"https://pith.science/api/pith-number/56UEKPRS4W3H3GQ6APWGJS6FLB/events.json","paper":"https://pith.science/paper/56UEKPRS"},"agent_actions":{"view_html":"https://pith.science/pith/56UEKPRS4W3H3GQ6APWGJS6FLB","download_json":"https://pith.science/pith/56UEKPRS4W3H3GQ6APWGJS6FLB.json","view_paper":"https://pith.science/paper/56UEKPRS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1606.03560&json=true","fetch_graph":"https://pith.science/api/pith-number/56UEKPRS4W3H3GQ6APWGJS6FLB/graph.json","fetch_events":"https://pith.science/api/pith-number/56UEKPRS4W3H3GQ6APWGJS6FLB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/56UEKPRS4W3H3GQ6APWGJS6FLB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/56UEKPRS4W3H3GQ6APWGJS6FLB/action/storage_attestation","attest_author":"https://pith.science/pith/56UEKPRS4W3H3GQ6APWGJS6FLB/action/author_attestation","sign_citation":"https://pith.science/pith/56UEKPRS4W3H3GQ6APWGJS6FLB/action/citation_signature","submit_replication":"https://pith.science/pith/56UEKPRS4W3H3GQ6APWGJS6FLB/action/replication_record"}},"created_at":"2026-05-18T00:50:01.196686+00:00","updated_at":"2026-05-18T00:50:01.196686+00:00"}