{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:BXMCJV37NS7NN4NOCKWALQKJ7B","short_pith_number":"pith:BXMCJV37","canonical_record":{"source":{"id":"1401.3461","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-01-15T05:21:26Z","cross_cats_sorted":[],"title_canon_sha256":"1e89b613dd334dd8b878eae563c2dbe2886cfd8979483843b0ad31fb123080c8","abstract_canon_sha256":"aff82f8b7a7e45ef8bc7db977f50dac0ad1d2e63f71d1760cd0a2eb7419fe710"},"schema_version":"1.0"},"canonical_sha256":"0dd824d77f6cbed6f1ae12ac05c149f86c0364d8976ec869858a68b25c44f2d5","source":{"kind":"arxiv","id":"1401.3461","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.3461","created_at":"2026-05-18T03:02:08Z"},{"alias_kind":"arxiv_version","alias_value":"1401.3461v1","created_at":"2026-05-18T03:02:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.3461","created_at":"2026-05-18T03:02:08Z"},{"alias_kind":"pith_short_12","alias_value":"BXMCJV37NS7N","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_16","alias_value":"BXMCJV37NS7NN4NO","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_8","alias_value":"BXMCJV37","created_at":"2026-05-18T12:28:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:BXMCJV37NS7NN4NOCKWALQKJ7B","target":"record","payload":{"canonical_record":{"source":{"id":"1401.3461","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-01-15T05:21:26Z","cross_cats_sorted":[],"title_canon_sha256":"1e89b613dd334dd8b878eae563c2dbe2886cfd8979483843b0ad31fb123080c8","abstract_canon_sha256":"aff82f8b7a7e45ef8bc7db977f50dac0ad1d2e63f71d1760cd0a2eb7419fe710"},"schema_version":"1.0"},"canonical_sha256":"0dd824d77f6cbed6f1ae12ac05c149f86c0364d8976ec869858a68b25c44f2d5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:02:08.953974Z","signature_b64":"x/CjbEEGxevNIRA5ki3s41y8CqL5oGRLFyiRdjpY1r8ADbQSzC1a/UuQ2nigZio4vOJoXc7/gYD2CtS1X03BCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0dd824d77f6cbed6f1ae12ac05c149f86c0364d8976ec869858a68b25c44f2d5","last_reissued_at":"2026-05-18T03:02:08.953396Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:02:08.953396Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1401.3461","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-05-18T03:02:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pTqrTBTqRlQ4CnAC/tDEH2/F0QtS4t9Dw4i1XJENMfKHJZOP/MBmBQsVr/hlEATa7+pPIdWSnT9LupKkT5CeCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T16:12:01.273061Z"},"content_sha256":"e3338c2d36aa5f923d917bb5c8f637413e1602234c4102b4eaa709ebdb4a4dee","schema_version":"1.0","event_id":"sha256:e3338c2d36aa5f923d917bb5c8f637413e1602234c4102b4eaa709ebdb4a4dee"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:BXMCJV37NS7NN4NOCKWALQKJ7B","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Bilinear Programming Approach for Multiagent Planning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Marek Petrik, Shlomo Zilberstein","submitted_at":"2014-01-15T05:21:26Z","abstract_excerpt":"Multiagent planning and coordination problems are common and known to be computationally hard.  We show that a wide range of two-agent problems can be formulated as bilinear programs.  We present a successive approximation algorithm that significantly outperforms the coverage set algorithm, which is the state-of-the-art method for this class of multiagent problems. Because the algorithm is formulated for bilinear programs, it is more general and simpler to implement. The new algorithm can be terminated at any time and-unlike the coverage set algorithm-it facilitates the derivation of a useful "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.3461","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"},"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:02:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"l+NYd6IgS982FFljm9VE+aWZCZ20qLTcUW4SvdlTW0cH9fyHUd7oy7nXVIBQ058lmLBDhcPLLTkku4Hd5dDXAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T16:12:01.273425Z"},"content_sha256":"63e188e9f32ab49ee5f61172175eb07ef111635835479c4430b1e4dce929b436","schema_version":"1.0","event_id":"sha256:63e188e9f32ab49ee5f61172175eb07ef111635835479c4430b1e4dce929b436"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BXMCJV37NS7NN4NOCKWALQKJ7B/bundle.json","state_url":"https://pith.science/pith/BXMCJV37NS7NN4NOCKWALQKJ7B/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BXMCJV37NS7NN4NOCKWALQKJ7B/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-03T16:12:01Z","links":{"resolver":"https://pith.science/pith/BXMCJV37NS7NN4NOCKWALQKJ7B","bundle":"https://pith.science/pith/BXMCJV37NS7NN4NOCKWALQKJ7B/bundle.json","state":"https://pith.science/pith/BXMCJV37NS7NN4NOCKWALQKJ7B/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BXMCJV37NS7NN4NOCKWALQKJ7B/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:BXMCJV37NS7NN4NOCKWALQKJ7B","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":"aff82f8b7a7e45ef8bc7db977f50dac0ad1d2e63f71d1760cd0a2eb7419fe710","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-01-15T05:21:26Z","title_canon_sha256":"1e89b613dd334dd8b878eae563c2dbe2886cfd8979483843b0ad31fb123080c8"},"schema_version":"1.0","source":{"id":"1401.3461","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.3461","created_at":"2026-05-18T03:02:08Z"},{"alias_kind":"arxiv_version","alias_value":"1401.3461v1","created_at":"2026-05-18T03:02:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.3461","created_at":"2026-05-18T03:02:08Z"},{"alias_kind":"pith_short_12","alias_value":"BXMCJV37NS7N","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_16","alias_value":"BXMCJV37NS7NN4NO","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_8","alias_value":"BXMCJV37","created_at":"2026-05-18T12:28:22Z"}],"graph_snapshots":[{"event_id":"sha256:63e188e9f32ab49ee5f61172175eb07ef111635835479c4430b1e4dce929b436","target":"graph","created_at":"2026-05-18T03:02:08Z","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":"Multiagent planning and coordination problems are common and known to be computationally hard.  We show that a wide range of two-agent problems can be formulated as bilinear programs.  We present a successive approximation algorithm that significantly outperforms the coverage set algorithm, which is the state-of-the-art method for this class of multiagent problems. Because the algorithm is formulated for bilinear programs, it is more general and simpler to implement. The new algorithm can be terminated at any time and-unlike the coverage set algorithm-it facilitates the derivation of a useful ","authors_text":"Marek Petrik, Shlomo Zilberstein","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-01-15T05:21:26Z","title":"A Bilinear Programming Approach for Multiagent Planning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.3461","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:e3338c2d36aa5f923d917bb5c8f637413e1602234c4102b4eaa709ebdb4a4dee","target":"record","created_at":"2026-05-18T03:02:08Z","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":"aff82f8b7a7e45ef8bc7db977f50dac0ad1d2e63f71d1760cd0a2eb7419fe710","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-01-15T05:21:26Z","title_canon_sha256":"1e89b613dd334dd8b878eae563c2dbe2886cfd8979483843b0ad31fb123080c8"},"schema_version":"1.0","source":{"id":"1401.3461","kind":"arxiv","version":1}},"canonical_sha256":"0dd824d77f6cbed6f1ae12ac05c149f86c0364d8976ec869858a68b25c44f2d5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0dd824d77f6cbed6f1ae12ac05c149f86c0364d8976ec869858a68b25c44f2d5","first_computed_at":"2026-05-18T03:02:08.953396Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:02:08.953396Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"x/CjbEEGxevNIRA5ki3s41y8CqL5oGRLFyiRdjpY1r8ADbQSzC1a/UuQ2nigZio4vOJoXc7/gYD2CtS1X03BCg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:02:08.953974Z","signed_message":"canonical_sha256_bytes"},"source_id":"1401.3461","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e3338c2d36aa5f923d917bb5c8f637413e1602234c4102b4eaa709ebdb4a4dee","sha256:63e188e9f32ab49ee5f61172175eb07ef111635835479c4430b1e4dce929b436"],"state_sha256":"f5b3ec4b800eab1ab3e9e6e80a0611eb11f4a030a9e375e1a5c3385e3529aa8e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"270/NYT6m8rWco7TLKsaSxZpkHm/wd5yaGFPxUncoLjmDj07+5d3iuoc3KFAx9773X0xv5bZFXxcNGU07DpjCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T16:12:01.275337Z","bundle_sha256":"857b02697e5163195ff8bb7955549597996d3911ab8451afdea03dba9314a339"}}