{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:F3USE5YBO7GKVXQ3Y4N6DOO7K3","short_pith_number":"pith:F3USE5YB","schema_version":"1.0","canonical_sha256":"2ee922770177ccaade1bc71be1b9df56c0500ae94f978bb76863c028e6f94826","source":{"kind":"arxiv","id":"1801.04115","version":1},"attestation_state":"computed","paper":{"title":"A Game Theoretic Approach to Hyperbolic Consensus Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.AP"],"primary_cat":"math.OC","authors_text":"Mauro Garavello, Rinaldo M. Colombo","submitted_at":"2018-01-12T09:59:01Z","abstract_excerpt":"We introduce the use of conservation laws to develop strategies in multi-player consensus games. First, basic well posedness results provide a reliable analytic setting. Then, a general non anticipative strategy is proposed through its rigorous analytic definitions and then tested by means of numerical integrations."},"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":"1801.04115","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-01-12T09:59:01Z","cross_cats_sorted":["math.AP"],"title_canon_sha256":"3a8ecc29ce2cd08bec41811d85da1188469b4e26ae76dc6ba39ed2bc2d66596b","abstract_canon_sha256":"bfab848f92fd00800d3f9b0643183fb0b83514457e054fd197c44a219680d380"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:26:11.821608Z","signature_b64":"wp7GUmjBIyVFKeENJ2glmGLwuHNzBYlf8Nm1DOeFSe0B5aE8uh9vCfb+2W5+atuiF7QdXW2vPYw+83is5qifDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2ee922770177ccaade1bc71be1b9df56c0500ae94f978bb76863c028e6f94826","last_reissued_at":"2026-05-18T00:26:11.820965Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:26:11.820965Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Game Theoretic Approach to Hyperbolic Consensus Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.AP"],"primary_cat":"math.OC","authors_text":"Mauro Garavello, Rinaldo M. Colombo","submitted_at":"2018-01-12T09:59:01Z","abstract_excerpt":"We introduce the use of conservation laws to develop strategies in multi-player consensus games. First, basic well posedness results provide a reliable analytic setting. Then, a general non anticipative strategy is proposed through its rigorous analytic definitions and then tested by means of numerical integrations."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.04115","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":"1801.04115","created_at":"2026-05-18T00:26:11.821053+00:00"},{"alias_kind":"arxiv_version","alias_value":"1801.04115v1","created_at":"2026-05-18T00:26:11.821053+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.04115","created_at":"2026-05-18T00:26:11.821053+00:00"},{"alias_kind":"pith_short_12","alias_value":"F3USE5YBO7GK","created_at":"2026-05-18T12:32:22.470017+00:00"},{"alias_kind":"pith_short_16","alias_value":"F3USE5YBO7GKVXQ3","created_at":"2026-05-18T12:32:22.470017+00:00"},{"alias_kind":"pith_short_8","alias_value":"F3USE5YB","created_at":"2026-05-18T12:32:22.470017+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/F3USE5YBO7GKVXQ3Y4N6DOO7K3","json":"https://pith.science/pith/F3USE5YBO7GKVXQ3Y4N6DOO7K3.json","graph_json":"https://pith.science/api/pith-number/F3USE5YBO7GKVXQ3Y4N6DOO7K3/graph.json","events_json":"https://pith.science/api/pith-number/F3USE5YBO7GKVXQ3Y4N6DOO7K3/events.json","paper":"https://pith.science/paper/F3USE5YB"},"agent_actions":{"view_html":"https://pith.science/pith/F3USE5YBO7GKVXQ3Y4N6DOO7K3","download_json":"https://pith.science/pith/F3USE5YBO7GKVXQ3Y4N6DOO7K3.json","view_paper":"https://pith.science/paper/F3USE5YB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1801.04115&json=true","fetch_graph":"https://pith.science/api/pith-number/F3USE5YBO7GKVXQ3Y4N6DOO7K3/graph.json","fetch_events":"https://pith.science/api/pith-number/F3USE5YBO7GKVXQ3Y4N6DOO7K3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/F3USE5YBO7GKVXQ3Y4N6DOO7K3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/F3USE5YBO7GKVXQ3Y4N6DOO7K3/action/storage_attestation","attest_author":"https://pith.science/pith/F3USE5YBO7GKVXQ3Y4N6DOO7K3/action/author_attestation","sign_citation":"https://pith.science/pith/F3USE5YBO7GKVXQ3Y4N6DOO7K3/action/citation_signature","submit_replication":"https://pith.science/pith/F3USE5YBO7GKVXQ3Y4N6DOO7K3/action/replication_record"}},"created_at":"2026-05-18T00:26:11.821053+00:00","updated_at":"2026-05-18T00:26:11.821053+00:00"}