{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:FZVU3VDXGWAOYIAXRHPLTUW6NL","short_pith_number":"pith:FZVU3VDX","canonical_record":{"source":{"id":"1710.10013","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2017-10-27T07:39:49Z","cross_cats_sorted":["cs.SY"],"title_canon_sha256":"4fce6c8e75c1ca4cebd9c059c1d0a31ad5efee8d0644f84389d44539a1a414ad","abstract_canon_sha256":"581d16bf9e90ebc4dc6fd5f347c2645a67ea9d0c351df72930564f06898ace0a"},"schema_version":"1.0"},"canonical_sha256":"2e6b4dd4773580ec201789deb9d2de6ad1cde91a4badcc7d8fa3d6a0498febcb","source":{"kind":"arxiv","id":"1710.10013","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.10013","created_at":"2026-05-18T00:31:54Z"},{"alias_kind":"arxiv_version","alias_value":"1710.10013v1","created_at":"2026-05-18T00:31:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.10013","created_at":"2026-05-18T00:31:54Z"},{"alias_kind":"pith_short_12","alias_value":"FZVU3VDXGWAO","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_16","alias_value":"FZVU3VDXGWAOYIAX","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_8","alias_value":"FZVU3VDX","created_at":"2026-05-18T12:31:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:FZVU3VDXGWAOYIAXRHPLTUW6NL","target":"record","payload":{"canonical_record":{"source":{"id":"1710.10013","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2017-10-27T07:39:49Z","cross_cats_sorted":["cs.SY"],"title_canon_sha256":"4fce6c8e75c1ca4cebd9c059c1d0a31ad5efee8d0644f84389d44539a1a414ad","abstract_canon_sha256":"581d16bf9e90ebc4dc6fd5f347c2645a67ea9d0c351df72930564f06898ace0a"},"schema_version":"1.0"},"canonical_sha256":"2e6b4dd4773580ec201789deb9d2de6ad1cde91a4badcc7d8fa3d6a0498febcb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:31:54.987466Z","signature_b64":"j11ZXFoThSjnVbm1PUUfBcw/kB+wnF4DCejigQ+cUaWPTur7aAc4B5AhbMGHCejwT7V8rtMGTgfMaJIdOFqPDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2e6b4dd4773580ec201789deb9d2de6ad1cde91a4badcc7d8fa3d6a0498febcb","last_reissued_at":"2026-05-18T00:31:54.987011Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:31:54.987011Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1710.10013","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-18T00:31:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ekj3CLjbuZWkqXFbvJ/EO2CjbWwz+KHTRk6mc10oMHspCwCkO9ujqEbeHKwBEmclLAjcd5osZfaAKihK3PA6DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T23:34:48.746130Z"},"content_sha256":"e3271ed273331f961f082e031b562ee4a11210a8e577126df00f35746a74b939","schema_version":"1.0","event_id":"sha256:e3271ed273331f961f082e031b562ee4a11210a8e577126df00f35746a74b939"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:FZVU3VDXGWAOYIAXRHPLTUW6NL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Declarative vs Rule-based Control for Flocking Dynamics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY"],"primary_cat":"cs.MA","authors_text":"Ashish Tiwari, Dung Phan, Junxing Yang, Nicola Paoletti, Radu Grosu, Scott A. Smolka, Scott D. Stoller, Shan Lin, Usama Mehmood","submitted_at":"2017-10-27T07:39:49Z","abstract_excerpt":"The popularity of rule-based flocking models, such as Reynolds' classic flocking model, raises the question of whether more declarative flocking models are possible. This question is motivated by the observation that declarative models are generally simpler and easier to design, understand, and analyze than operational models. We introduce a very simple control law for flocking based on a cost function capturing cohesion (agents want to stay together) and separation (agents do not want to get too close). We refer to it as {\\textit declarative flocking} (DF). We use model-predictive control (MP"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.10013","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-18T00:31:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qTLP1zntHyyTSlyKv25wLJhld0Q9Dmus7mT2BgVWrTbPn/jXghm6vFzkjMIuFtTRjBNF8O4+cnvgiBHN9U3jAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T23:34:48.746600Z"},"content_sha256":"313ffb863765b3f8743d9e59c127ae96d509b13bbdab9fade882952f41cea5d3","schema_version":"1.0","event_id":"sha256:313ffb863765b3f8743d9e59c127ae96d509b13bbdab9fade882952f41cea5d3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FZVU3VDXGWAOYIAXRHPLTUW6NL/bundle.json","state_url":"https://pith.science/pith/FZVU3VDXGWAOYIAXRHPLTUW6NL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FZVU3VDXGWAOYIAXRHPLTUW6NL/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-05-30T23:34:48Z","links":{"resolver":"https://pith.science/pith/FZVU3VDXGWAOYIAXRHPLTUW6NL","bundle":"https://pith.science/pith/FZVU3VDXGWAOYIAXRHPLTUW6NL/bundle.json","state":"https://pith.science/pith/FZVU3VDXGWAOYIAXRHPLTUW6NL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FZVU3VDXGWAOYIAXRHPLTUW6NL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:FZVU3VDXGWAOYIAXRHPLTUW6NL","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":"581d16bf9e90ebc4dc6fd5f347c2645a67ea9d0c351df72930564f06898ace0a","cross_cats_sorted":["cs.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2017-10-27T07:39:49Z","title_canon_sha256":"4fce6c8e75c1ca4cebd9c059c1d0a31ad5efee8d0644f84389d44539a1a414ad"},"schema_version":"1.0","source":{"id":"1710.10013","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.10013","created_at":"2026-05-18T00:31:54Z"},{"alias_kind":"arxiv_version","alias_value":"1710.10013v1","created_at":"2026-05-18T00:31:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.10013","created_at":"2026-05-18T00:31:54Z"},{"alias_kind":"pith_short_12","alias_value":"FZVU3VDXGWAO","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_16","alias_value":"FZVU3VDXGWAOYIAX","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_8","alias_value":"FZVU3VDX","created_at":"2026-05-18T12:31:15Z"}],"graph_snapshots":[{"event_id":"sha256:313ffb863765b3f8743d9e59c127ae96d509b13bbdab9fade882952f41cea5d3","target":"graph","created_at":"2026-05-18T00:31:54Z","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":"The popularity of rule-based flocking models, such as Reynolds' classic flocking model, raises the question of whether more declarative flocking models are possible. This question is motivated by the observation that declarative models are generally simpler and easier to design, understand, and analyze than operational models. We introduce a very simple control law for flocking based on a cost function capturing cohesion (agents want to stay together) and separation (agents do not want to get too close). We refer to it as {\\textit declarative flocking} (DF). We use model-predictive control (MP","authors_text":"Ashish Tiwari, Dung Phan, Junxing Yang, Nicola Paoletti, Radu Grosu, Scott A. Smolka, Scott D. Stoller, Shan Lin, Usama Mehmood","cross_cats":["cs.SY"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2017-10-27T07:39:49Z","title":"Declarative vs Rule-based Control for Flocking Dynamics"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.10013","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:e3271ed273331f961f082e031b562ee4a11210a8e577126df00f35746a74b939","target":"record","created_at":"2026-05-18T00:31:54Z","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":"581d16bf9e90ebc4dc6fd5f347c2645a67ea9d0c351df72930564f06898ace0a","cross_cats_sorted":["cs.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2017-10-27T07:39:49Z","title_canon_sha256":"4fce6c8e75c1ca4cebd9c059c1d0a31ad5efee8d0644f84389d44539a1a414ad"},"schema_version":"1.0","source":{"id":"1710.10013","kind":"arxiv","version":1}},"canonical_sha256":"2e6b4dd4773580ec201789deb9d2de6ad1cde91a4badcc7d8fa3d6a0498febcb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2e6b4dd4773580ec201789deb9d2de6ad1cde91a4badcc7d8fa3d6a0498febcb","first_computed_at":"2026-05-18T00:31:54.987011Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:31:54.987011Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"j11ZXFoThSjnVbm1PUUfBcw/kB+wnF4DCejigQ+cUaWPTur7aAc4B5AhbMGHCejwT7V8rtMGTgfMaJIdOFqPDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:31:54.987466Z","signed_message":"canonical_sha256_bytes"},"source_id":"1710.10013","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e3271ed273331f961f082e031b562ee4a11210a8e577126df00f35746a74b939","sha256:313ffb863765b3f8743d9e59c127ae96d509b13bbdab9fade882952f41cea5d3"],"state_sha256":"20d1415e4d5734ae938d07ca1964a180c53489e187c6ed88e22a5f491e3690c2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ajKyFkMP8wIGfGt3j4vXKyp4J51QJg2FquDtvo6i5M0VPJj4iRXTc5Ur15S8l4XOgzXDZOSUmc8vV8lfGuRCAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T23:34:48.750760Z","bundle_sha256":"5acda58fc87243e3420b0f318b0df922445582b166ee361edec48cb412feacfb"}}