{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:LE3HNIVV6JHJVPXBGDCPPBDS4W","short_pith_number":"pith:LE3HNIVV","canonical_record":{"source":{"id":"1111.0875","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2011-11-03T15:21:25Z","cross_cats_sorted":[],"title_canon_sha256":"c7ce44366d58e7cc2699d9cdd2f06f6cce559e09936b8bb7d985486380e4349f","abstract_canon_sha256":"a37d3b2f696e8055eced3e346bf30084fced7ed90de0d427281d636afb151593"},"schema_version":"1.0"},"canonical_sha256":"593676a2b5f24e9abee130c4f78472e5851a14a3c658ac14fec866592b3f7101","source":{"kind":"arxiv","id":"1111.0875","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1111.0875","created_at":"2026-05-18T03:43:18Z"},{"alias_kind":"arxiv_version","alias_value":"1111.0875v2","created_at":"2026-05-18T03:43:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.0875","created_at":"2026-05-18T03:43:18Z"},{"alias_kind":"pith_short_12","alias_value":"LE3HNIVV6JHJ","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_16","alias_value":"LE3HNIVV6JHJVPXB","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_8","alias_value":"LE3HNIVV","created_at":"2026-05-18T12:26:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:LE3HNIVV6JHJVPXBGDCPPBDS4W","target":"record","payload":{"canonical_record":{"source":{"id":"1111.0875","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2011-11-03T15:21:25Z","cross_cats_sorted":[],"title_canon_sha256":"c7ce44366d58e7cc2699d9cdd2f06f6cce559e09936b8bb7d985486380e4349f","abstract_canon_sha256":"a37d3b2f696e8055eced3e346bf30084fced7ed90de0d427281d636afb151593"},"schema_version":"1.0"},"canonical_sha256":"593676a2b5f24e9abee130c4f78472e5851a14a3c658ac14fec866592b3f7101","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:43:18.565202Z","signature_b64":"NO1PMmt73SlCaqTir5QIbzt4c6Gq6f2s8xnVWtlxIWh8oaDgO2vz36stcWU0/KHKiHbU37hpdrJjOb0ZNUOTCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"593676a2b5f24e9abee130c4f78472e5851a14a3c658ac14fec866592b3f7101","last_reissued_at":"2026-05-18T03:43:18.564686Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:43:18.564686Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1111.0875","source_version":2,"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-05-18T03:43:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+4xK3aM94kDrEk8I+CzwIUnlMynSHh0VGE/o5v7cNVtoCA7/wHyzXl3T6omqbDzDkuefsDPXLtKpzAzrlMEIDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T10:36:22.902299Z"},"content_sha256":"63de87631b846f2db5c5e8a1f4c381f4c2051be3f624839682fef061aa4777ff","schema_version":"1.0","event_id":"sha256:63de87631b846f2db5c5e8a1f4c381f4c2051be3f624839682fef061aa4777ff"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:LE3HNIVV6JHJVPXBGDCPPBDS4W","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Game Theoretic Iterative Partitioning for Dynamic Load Balancing in Distributed Network Simulation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Aditya Kurve, Christopher Griffin, David J. Miller, George Kesidis","submitted_at":"2011-11-03T15:21:25Z","abstract_excerpt":"High fidelity simulation of large-sized complex networks can be realized on a distributed computing platform that leverages the combined resources of multiple processors or machines. In a discrete event driven simulation, the assignment of logical processes (LPs) to machines is a critical step that affects the computational and communication burden on the machines, which in turn affects the simulation execution time of the experiment. We study a network partitioning game wherein each node (LP) acts as a selfish player. We derive two local node-level cost frameworks which are feasible in the se"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1111.0875","kind":"arxiv","version":2},"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"},"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-05-18T03:43:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QIFPzxfTzly4ydDQhGs9+cTZzphwyhSq0nD1A8PCwimKqh00UAShWsu2vQqCjeSoLRHqtc9hAeSLh0Tv/Qb9AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T10:36:22.902655Z"},"content_sha256":"a0ffadb36ff1e449864212b69a43e6ba36d54d93a41cfb974815e4a658ee3345","schema_version":"1.0","event_id":"sha256:a0ffadb36ff1e449864212b69a43e6ba36d54d93a41cfb974815e4a658ee3345"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LE3HNIVV6JHJVPXBGDCPPBDS4W/bundle.json","state_url":"https://pith.science/pith/LE3HNIVV6JHJVPXBGDCPPBDS4W/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LE3HNIVV6JHJVPXBGDCPPBDS4W/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-06-03T10:36:22Z","links":{"resolver":"https://pith.science/pith/LE3HNIVV6JHJVPXBGDCPPBDS4W","bundle":"https://pith.science/pith/LE3HNIVV6JHJVPXBGDCPPBDS4W/bundle.json","state":"https://pith.science/pith/LE3HNIVV6JHJVPXBGDCPPBDS4W/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LE3HNIVV6JHJVPXBGDCPPBDS4W/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:LE3HNIVV6JHJVPXBGDCPPBDS4W","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":"a37d3b2f696e8055eced3e346bf30084fced7ed90de0d427281d636afb151593","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2011-11-03T15:21:25Z","title_canon_sha256":"c7ce44366d58e7cc2699d9cdd2f06f6cce559e09936b8bb7d985486380e4349f"},"schema_version":"1.0","source":{"id":"1111.0875","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1111.0875","created_at":"2026-05-18T03:43:18Z"},{"alias_kind":"arxiv_version","alias_value":"1111.0875v2","created_at":"2026-05-18T03:43:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.0875","created_at":"2026-05-18T03:43:18Z"},{"alias_kind":"pith_short_12","alias_value":"LE3HNIVV6JHJ","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_16","alias_value":"LE3HNIVV6JHJVPXB","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_8","alias_value":"LE3HNIVV","created_at":"2026-05-18T12:26:34Z"}],"graph_snapshots":[{"event_id":"sha256:a0ffadb36ff1e449864212b69a43e6ba36d54d93a41cfb974815e4a658ee3345","target":"graph","created_at":"2026-05-18T03:43:18Z","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"},"paper":{"abstract_excerpt":"High fidelity simulation of large-sized complex networks can be realized on a distributed computing platform that leverages the combined resources of multiple processors or machines. In a discrete event driven simulation, the assignment of logical processes (LPs) to machines is a critical step that affects the computational and communication burden on the machines, which in turn affects the simulation execution time of the experiment. We study a network partitioning game wherein each node (LP) acts as a selfish player. We derive two local node-level cost frameworks which are feasible in the se","authors_text":"Aditya Kurve, Christopher Griffin, David J. Miller, George Kesidis","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2011-11-03T15:21:25Z","title":"Game Theoretic Iterative Partitioning for Dynamic Load Balancing in Distributed Network Simulation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1111.0875","kind":"arxiv","version":2},"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:63de87631b846f2db5c5e8a1f4c381f4c2051be3f624839682fef061aa4777ff","target":"record","created_at":"2026-05-18T03:43:18Z","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":"a37d3b2f696e8055eced3e346bf30084fced7ed90de0d427281d636afb151593","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2011-11-03T15:21:25Z","title_canon_sha256":"c7ce44366d58e7cc2699d9cdd2f06f6cce559e09936b8bb7d985486380e4349f"},"schema_version":"1.0","source":{"id":"1111.0875","kind":"arxiv","version":2}},"canonical_sha256":"593676a2b5f24e9abee130c4f78472e5851a14a3c658ac14fec866592b3f7101","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"593676a2b5f24e9abee130c4f78472e5851a14a3c658ac14fec866592b3f7101","first_computed_at":"2026-05-18T03:43:18.564686Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:43:18.564686Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"NO1PMmt73SlCaqTir5QIbzt4c6Gq6f2s8xnVWtlxIWh8oaDgO2vz36stcWU0/KHKiHbU37hpdrJjOb0ZNUOTCg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:43:18.565202Z","signed_message":"canonical_sha256_bytes"},"source_id":"1111.0875","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:63de87631b846f2db5c5e8a1f4c381f4c2051be3f624839682fef061aa4777ff","sha256:a0ffadb36ff1e449864212b69a43e6ba36d54d93a41cfb974815e4a658ee3345"],"state_sha256":"78a6376bac6bd88d1ed0432d5fa2e803e3dfe79128da8c7ba5ccb815616f42b4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Zbh64lymlPd4n4vMmG0xZtw/bVSstw4zzdZ/bOpGHLNOtMltAqbpHjaSop0n0xuEo7c+kYTWcJSKQ02LerucAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T10:36:22.904670Z","bundle_sha256":"b98eb2e5373bbf70aafe2c67d98dd1a8ff1781aefb3c3c26891c3f831bed02d7"}}