{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:KMJHLBF3L35NPUT2AT67A4OIS3","short_pith_number":"pith:KMJHLBF3","canonical_record":{"source":{"id":"2506.08580","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2025-06-10T08:51:18Z","cross_cats_sorted":[],"title_canon_sha256":"6f707973e60b2f34a3b367c0a37f616f31b8804860b713b5649c22c920ff4944","abstract_canon_sha256":"fa366353d2d3d77b89d25f5dece2e11c5e460ea59b423388423ff492157ecdd3"},"schema_version":"1.0"},"canonical_sha256":"53127584bb5efad7d27a04fdf071c896fbc123ad100c543339b63a53b205e9bf","source":{"kind":"arxiv","id":"2506.08580","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2506.08580","created_at":"2026-07-05T11:19:10Z"},{"alias_kind":"arxiv_version","alias_value":"2506.08580v1","created_at":"2026-07-05T11:19:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.08580","created_at":"2026-07-05T11:19:10Z"},{"alias_kind":"pith_short_12","alias_value":"KMJHLBF3L35N","created_at":"2026-07-05T11:19:10Z"},{"alias_kind":"pith_short_16","alias_value":"KMJHLBF3L35NPUT2","created_at":"2026-07-05T11:19:10Z"},{"alias_kind":"pith_short_8","alias_value":"KMJHLBF3","created_at":"2026-07-05T11:19:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:KMJHLBF3L35NPUT2AT67A4OIS3","target":"record","payload":{"canonical_record":{"source":{"id":"2506.08580","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2025-06-10T08:51:18Z","cross_cats_sorted":[],"title_canon_sha256":"6f707973e60b2f34a3b367c0a37f616f31b8804860b713b5649c22c920ff4944","abstract_canon_sha256":"fa366353d2d3d77b89d25f5dece2e11c5e460ea59b423388423ff492157ecdd3"},"schema_version":"1.0"},"canonical_sha256":"53127584bb5efad7d27a04fdf071c896fbc123ad100c543339b63a53b205e9bf","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:19:10.006060Z","signature_b64":"x8/lZonOyX6E1AYgRIKpDLG8YRRIw88XKuhXlISELuiWTYxmU86XRbNpB/zjboDbJkk0ZwiHxQXdZ6+dZbouDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"53127584bb5efad7d27a04fdf071c896fbc123ad100c543339b63a53b205e9bf","last_reissued_at":"2026-07-05T11:19:10.005586Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:19:10.005586Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2506.08580","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T11:19:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6I/IaHoqMKBtfRW2gRqlrfjId0PTa6BF93DVDoDwoh0G4pHECBRlqRfqhN++7VH9+BbTYeRRZLwGyjxI/5gsBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T03:42:52.806201Z"},"content_sha256":"7f03ef2462e260b9b8d7b510ff0c0a58bd263e57f680f18413cdc26aa18bbe4a","schema_version":"1.0","event_id":"sha256:7f03ef2462e260b9b8d7b510ff0c0a58bd263e57f680f18413cdc26aa18bbe4a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:KMJHLBF3L35NPUT2AT67A4OIS3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"HGFormer: A Hierarchical Graph Transformer Framework for Two-Stage Colonel Blotto Games via Reinforcement Learning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Jinlong Lei, Peng Yi, Yang Lv","submitted_at":"2025-06-10T08:51:18Z","abstract_excerpt":"Two-stage Colonel Blotto game represents a typical adversarial resource allocation problem, in which two opposing agents sequentially allocate resources in a network topology across two phases: an initial resource deployment followed by multiple rounds of dynamic reallocation adjustments. The sequential dependency between game stages and the complex constraints imposed by the graph topology make it difficult for traditional approaches to attain a globally optimal strategy. To address these challenges, we propose a hierarchical graph Transformer framework called HGformer. By incorporating an en"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.08580","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/2506.08580/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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T11:19:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IPdr6Dtr1ndYMcEyiS8NUPHTGSiOssysu5WezaYWqY7Wry9+k4kFubVzylqVrntygey20hLEsdeK0Xl8OqinAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T03:42:52.806768Z"},"content_sha256":"3ea4503f6e3ad76002ad38f013ada02cf7b4c5a2bed889bc7a43b5e50cc9e4ac","schema_version":"1.0","event_id":"sha256:3ea4503f6e3ad76002ad38f013ada02cf7b4c5a2bed889bc7a43b5e50cc9e4ac"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KMJHLBF3L35NPUT2AT67A4OIS3/bundle.json","state_url":"https://pith.science/pith/KMJHLBF3L35NPUT2AT67A4OIS3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KMJHLBF3L35NPUT2AT67A4OIS3/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-08T03:42:52Z","links":{"resolver":"https://pith.science/pith/KMJHLBF3L35NPUT2AT67A4OIS3","bundle":"https://pith.science/pith/KMJHLBF3L35NPUT2AT67A4OIS3/bundle.json","state":"https://pith.science/pith/KMJHLBF3L35NPUT2AT67A4OIS3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KMJHLBF3L35NPUT2AT67A4OIS3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:KMJHLBF3L35NPUT2AT67A4OIS3","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"fa366353d2d3d77b89d25f5dece2e11c5e460ea59b423388423ff492157ecdd3","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2025-06-10T08:51:18Z","title_canon_sha256":"6f707973e60b2f34a3b367c0a37f616f31b8804860b713b5649c22c920ff4944"},"schema_version":"1.0","source":{"id":"2506.08580","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2506.08580","created_at":"2026-07-05T11:19:10Z"},{"alias_kind":"arxiv_version","alias_value":"2506.08580v1","created_at":"2026-07-05T11:19:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.08580","created_at":"2026-07-05T11:19:10Z"},{"alias_kind":"pith_short_12","alias_value":"KMJHLBF3L35N","created_at":"2026-07-05T11:19:10Z"},{"alias_kind":"pith_short_16","alias_value":"KMJHLBF3L35NPUT2","created_at":"2026-07-05T11:19:10Z"},{"alias_kind":"pith_short_8","alias_value":"KMJHLBF3","created_at":"2026-07-05T11:19:10Z"}],"graph_snapshots":[{"event_id":"sha256:3ea4503f6e3ad76002ad38f013ada02cf7b4c5a2bed889bc7a43b5e50cc9e4ac","target":"graph","created_at":"2026-07-05T11:19:10Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2506.08580/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Two-stage Colonel Blotto game represents a typical adversarial resource allocation problem, in which two opposing agents sequentially allocate resources in a network topology across two phases: an initial resource deployment followed by multiple rounds of dynamic reallocation adjustments. The sequential dependency between game stages and the complex constraints imposed by the graph topology make it difficult for traditional approaches to attain a globally optimal strategy. To address these challenges, we propose a hierarchical graph Transformer framework called HGformer. By incorporating an en","authors_text":"Jinlong Lei, Peng Yi, Yang Lv","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2025-06-10T08:51:18Z","title":"HGFormer: A Hierarchical Graph Transformer Framework for Two-Stage Colonel Blotto Games via Reinforcement Learning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.08580","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:7f03ef2462e260b9b8d7b510ff0c0a58bd263e57f680f18413cdc26aa18bbe4a","target":"record","created_at":"2026-07-05T11:19:10Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"fa366353d2d3d77b89d25f5dece2e11c5e460ea59b423388423ff492157ecdd3","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2025-06-10T08:51:18Z","title_canon_sha256":"6f707973e60b2f34a3b367c0a37f616f31b8804860b713b5649c22c920ff4944"},"schema_version":"1.0","source":{"id":"2506.08580","kind":"arxiv","version":1}},"canonical_sha256":"53127584bb5efad7d27a04fdf071c896fbc123ad100c543339b63a53b205e9bf","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"53127584bb5efad7d27a04fdf071c896fbc123ad100c543339b63a53b205e9bf","first_computed_at":"2026-07-05T11:19:10.005586Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:19:10.005586Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"x8/lZonOyX6E1AYgRIKpDLG8YRRIw88XKuhXlISELuiWTYxmU86XRbNpB/zjboDbJkk0ZwiHxQXdZ6+dZbouDw==","signature_status":"signed_v1","signed_at":"2026-07-05T11:19:10.006060Z","signed_message":"canonical_sha256_bytes"},"source_id":"2506.08580","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7f03ef2462e260b9b8d7b510ff0c0a58bd263e57f680f18413cdc26aa18bbe4a","sha256:3ea4503f6e3ad76002ad38f013ada02cf7b4c5a2bed889bc7a43b5e50cc9e4ac"],"state_sha256":"b29444292d82c17b5f3f7a90f9814dfd4e3d88989e6b6c1f3e106313975d62e4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GWVB0cbuc9yiPWv3JKTv1kDPGVYxxKAnVUMUgcMcrgez2JnLZP6KzSPrRfRkl1tTfJDnyXSrh6k5UlR9Ls9tBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-08T03:42:52.811051Z","bundle_sha256":"e5fdbbc3e7498acf5e43ac34ed979d4ea3531550e2284ea6a2b257f03a68fde3"}}