{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:TXP7WPAXH7FVSYOPVTZ4DH3MXU","short_pith_number":"pith:TXP7WPAX","schema_version":"1.0","canonical_sha256":"9ddffb3c173fcb5961cfacf3c19f6cbd1cddfd6f4420cbcdd6fa6feb1aa3af58","source":{"kind":"arxiv","id":"2406.16812","version":1},"attestation_state":"computed","paper":{"title":"FlipDyn in Graphs: Resource Takeover Games in Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Naira Hovakimyan, Sandeep Banik, Shaunak D. Bopardikar","submitted_at":"2024-06-24T17:24:05Z","abstract_excerpt":"We present \\texttt{FlipDyn-G}, a dynamic game model extending the \\texttt{FlipDyn} framework to a graph-based setting, where each node represents a dynamical system. This model captures the interactions between a defender and an adversary who strategically take over nodes in a graph to minimize (resp. maximize) a finite horizon additive cost. At any time, the \\texttt{FlipDyn} state is represented as the current node, and each player can transition the \\texttt{FlipDyn} state to a depending based on the connectivity from the current node. Such transitions are driven by the node dynamics, state, "},"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":"2406.16812","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2024-06-24T17:24:05Z","cross_cats_sorted":[],"title_canon_sha256":"067e36ab34d3e7300f3810c058845e6a0ad0f7a6f811e928d96b679168c366fb","abstract_canon_sha256":"cfcfca2ad402aeb0c8a7ca7e1afa670bb4bbab19793087ea9e58c30d8e9bd582"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:36:04.027903Z","signature_b64":"oVd+rWgooKT34/Y+2ME7OpTqjG9nXB4zJBSA1kbqF6xUMCFXmKEj560LsRFl27DWcM6zIyLrC+3vhMkN8AvqCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9ddffb3c173fcb5961cfacf3c19f6cbd1cddfd6f4420cbcdd6fa6feb1aa3af58","last_reissued_at":"2026-07-05T08:36:04.027486Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:36:04.027486Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"FlipDyn in Graphs: Resource Takeover Games in Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Naira Hovakimyan, Sandeep Banik, Shaunak D. Bopardikar","submitted_at":"2024-06-24T17:24:05Z","abstract_excerpt":"We present \\texttt{FlipDyn-G}, a dynamic game model extending the \\texttt{FlipDyn} framework to a graph-based setting, where each node represents a dynamical system. This model captures the interactions between a defender and an adversary who strategically take over nodes in a graph to minimize (resp. maximize) a finite horizon additive cost. At any time, the \\texttt{FlipDyn} state is represented as the current node, and each player can transition the \\texttt{FlipDyn} state to a depending based on the connectivity from the current node. Such transitions are driven by the node dynamics, state, "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2406.16812","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2406.16812/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2406.16812","created_at":"2026-07-05T08:36:04.027544+00:00"},{"alias_kind":"arxiv_version","alias_value":"2406.16812v1","created_at":"2026-07-05T08:36:04.027544+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2406.16812","created_at":"2026-07-05T08:36:04.027544+00:00"},{"alias_kind":"pith_short_12","alias_value":"TXP7WPAXH7FV","created_at":"2026-07-05T08:36:04.027544+00:00"},{"alias_kind":"pith_short_16","alias_value":"TXP7WPAXH7FVSYOP","created_at":"2026-07-05T08:36:04.027544+00:00"},{"alias_kind":"pith_short_8","alias_value":"TXP7WPAX","created_at":"2026-07-05T08:36:04.027544+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/TXP7WPAXH7FVSYOPVTZ4DH3MXU","json":"https://pith.science/pith/TXP7WPAXH7FVSYOPVTZ4DH3MXU.json","graph_json":"https://pith.science/api/pith-number/TXP7WPAXH7FVSYOPVTZ4DH3MXU/graph.json","events_json":"https://pith.science/api/pith-number/TXP7WPAXH7FVSYOPVTZ4DH3MXU/events.json","paper":"https://pith.science/paper/TXP7WPAX"},"agent_actions":{"view_html":"https://pith.science/pith/TXP7WPAXH7FVSYOPVTZ4DH3MXU","download_json":"https://pith.science/pith/TXP7WPAXH7FVSYOPVTZ4DH3MXU.json","view_paper":"https://pith.science/paper/TXP7WPAX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2406.16812&json=true","fetch_graph":"https://pith.science/api/pith-number/TXP7WPAXH7FVSYOPVTZ4DH3MXU/graph.json","fetch_events":"https://pith.science/api/pith-number/TXP7WPAXH7FVSYOPVTZ4DH3MXU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TXP7WPAXH7FVSYOPVTZ4DH3MXU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TXP7WPAXH7FVSYOPVTZ4DH3MXU/action/storage_attestation","attest_author":"https://pith.science/pith/TXP7WPAXH7FVSYOPVTZ4DH3MXU/action/author_attestation","sign_citation":"https://pith.science/pith/TXP7WPAXH7FVSYOPVTZ4DH3MXU/action/citation_signature","submit_replication":"https://pith.science/pith/TXP7WPAXH7FVSYOPVTZ4DH3MXU/action/replication_record"}},"created_at":"2026-07-05T08:36:04.027544+00:00","updated_at":"2026-07-05T08:36:04.027544+00:00"}