{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:PJYH2MMUEGD5TUZ4GQMDS7HM6E","short_pith_number":"pith:PJYH2MMU","schema_version":"1.0","canonical_sha256":"7a707d31942187d9d33c3418397cecf12d271d170bf70cf54fc8a4aa88eaa56d","source":{"kind":"arxiv","id":"1511.02390","version":3},"attestation_state":"computed","paper":{"title":"Searching of equilibriums in hierarchical congestion population games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Alexander Gasnikov, Evgenia Gasnikova, Inna Usik, Sergey Matsievsky","submitted_at":"2015-11-07T19:51:56Z","abstract_excerpt":"An universal primal-dual approach of description equilibriums in large class of hierarchical congestion population games is proposed. At the very core of the approach is hierarchy of enclosed to each other transport networks. In different time-scales corresponding logit dynamics on this networks is considered. This dynamics reflect restricted rationality of the agents. Searching of equilibrium configuration to the multi-level convex optimization problem is reduced (in other words variational principle for these class of the games/models is formulated). Then the dual problem is formulated. This"},"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":"1511.02390","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-11-07T19:51:56Z","cross_cats_sorted":[],"title_canon_sha256":"79b78c331ac9b78a4f2a4b722de5310e227f567c1e009ce9b32d1881c879dc13","abstract_canon_sha256":"c5d82659132044ba56a21a793121143f2432c83623ace8a64ca34113481aef36"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:19:28.935724Z","signature_b64":"nMWgbbW4Z2TCiDh4cjsK6LCtQ+c0c/gVSYL5DT0/lkUpo1CpHDf4fIVjZVPnqXGq3y46L0AYvMNZwQaLdPvSDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7a707d31942187d9d33c3418397cecf12d271d170bf70cf54fc8a4aa88eaa56d","last_reissued_at":"2026-05-18T01:19:28.935140Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:19:28.935140Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Searching of equilibriums in hierarchical congestion population games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Alexander Gasnikov, Evgenia Gasnikova, Inna Usik, Sergey Matsievsky","submitted_at":"2015-11-07T19:51:56Z","abstract_excerpt":"An universal primal-dual approach of description equilibriums in large class of hierarchical congestion population games is proposed. At the very core of the approach is hierarchy of enclosed to each other transport networks. In different time-scales corresponding logit dynamics on this networks is considered. This dynamics reflect restricted rationality of the agents. Searching of equilibrium configuration to the multi-level convex optimization problem is reduced (in other words variational principle for these class of the games/models is formulated). Then the dual problem is formulated. This"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.02390","kind":"arxiv","version":3},"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":"1511.02390","created_at":"2026-05-18T01:19:28.935214+00:00"},{"alias_kind":"arxiv_version","alias_value":"1511.02390v3","created_at":"2026-05-18T01:19:28.935214+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.02390","created_at":"2026-05-18T01:19:28.935214+00:00"},{"alias_kind":"pith_short_12","alias_value":"PJYH2MMUEGD5","created_at":"2026-05-18T12:29:37.295048+00:00"},{"alias_kind":"pith_short_16","alias_value":"PJYH2MMUEGD5TUZ4","created_at":"2026-05-18T12:29:37.295048+00:00"},{"alias_kind":"pith_short_8","alias_value":"PJYH2MMU","created_at":"2026-05-18T12:29:37.295048+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/PJYH2MMUEGD5TUZ4GQMDS7HM6E","json":"https://pith.science/pith/PJYH2MMUEGD5TUZ4GQMDS7HM6E.json","graph_json":"https://pith.science/api/pith-number/PJYH2MMUEGD5TUZ4GQMDS7HM6E/graph.json","events_json":"https://pith.science/api/pith-number/PJYH2MMUEGD5TUZ4GQMDS7HM6E/events.json","paper":"https://pith.science/paper/PJYH2MMU"},"agent_actions":{"view_html":"https://pith.science/pith/PJYH2MMUEGD5TUZ4GQMDS7HM6E","download_json":"https://pith.science/pith/PJYH2MMUEGD5TUZ4GQMDS7HM6E.json","view_paper":"https://pith.science/paper/PJYH2MMU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1511.02390&json=true","fetch_graph":"https://pith.science/api/pith-number/PJYH2MMUEGD5TUZ4GQMDS7HM6E/graph.json","fetch_events":"https://pith.science/api/pith-number/PJYH2MMUEGD5TUZ4GQMDS7HM6E/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PJYH2MMUEGD5TUZ4GQMDS7HM6E/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PJYH2MMUEGD5TUZ4GQMDS7HM6E/action/storage_attestation","attest_author":"https://pith.science/pith/PJYH2MMUEGD5TUZ4GQMDS7HM6E/action/author_attestation","sign_citation":"https://pith.science/pith/PJYH2MMUEGD5TUZ4GQMDS7HM6E/action/citation_signature","submit_replication":"https://pith.science/pith/PJYH2MMUEGD5TUZ4GQMDS7HM6E/action/replication_record"}},"created_at":"2026-05-18T01:19:28.935214+00:00","updated_at":"2026-05-18T01:19:28.935214+00:00"}