{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:6CP233L7TE7S4FUBXO4KIN5R5P","short_pith_number":"pith:6CP233L7","canonical_record":{"source":{"id":"1609.03847","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-09-13T14:17:32Z","cross_cats_sorted":[],"title_canon_sha256":"1251c82c50a142d9a6db321eac5a0f12df1de1ae6155e44fe9d4bb75aa13547d","abstract_canon_sha256":"e6590d8d0f52aea05ce08ac97930e8fd764fd3ebf029c51dd18387a060e02dc1"},"schema_version":"1.0"},"canonical_sha256":"f09faded7f993f2e1681bbb8a437b1ebcd864ba9441c4a7ff453671549b9c676","source":{"kind":"arxiv","id":"1609.03847","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.03847","created_at":"2026-05-18T01:04:42Z"},{"alias_kind":"arxiv_version","alias_value":"1609.03847v1","created_at":"2026-05-18T01:04:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.03847","created_at":"2026-05-18T01:04:42Z"},{"alias_kind":"pith_short_12","alias_value":"6CP233L7TE7S","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_16","alias_value":"6CP233L7TE7S4FUB","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_8","alias_value":"6CP233L7","created_at":"2026-05-18T12:30:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:6CP233L7TE7S4FUBXO4KIN5R5P","target":"record","payload":{"canonical_record":{"source":{"id":"1609.03847","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-09-13T14:17:32Z","cross_cats_sorted":[],"title_canon_sha256":"1251c82c50a142d9a6db321eac5a0f12df1de1ae6155e44fe9d4bb75aa13547d","abstract_canon_sha256":"e6590d8d0f52aea05ce08ac97930e8fd764fd3ebf029c51dd18387a060e02dc1"},"schema_version":"1.0"},"canonical_sha256":"f09faded7f993f2e1681bbb8a437b1ebcd864ba9441c4a7ff453671549b9c676","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:04:42.307836Z","signature_b64":"d2FfGWdXJCPHwzmLfLEwL2E6Nlde6JWqyFM7NWjv9m0vxmkTSqVhrcZxsZkG7CF165rLMh7qoGvWUZSSuuejDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f09faded7f993f2e1681bbb8a437b1ebcd864ba9441c4a7ff453671549b9c676","last_reissued_at":"2026-05-18T01:04:42.307282Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:04:42.307282Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1609.03847","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-18T01:04:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VEDvgXoJ6bf6Gz20J8NNh/luFmx0PEzoFGOVKgzH4KR5i+f8XQtjUU8dpqnBGnC41tDzyURzgfWuXAW20puRDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T16:41:31.382647Z"},"content_sha256":"f64885e2c8a616440c2c68d8b779c71ddabeb0d8f524c1a5f5ddae42458497b6","schema_version":"1.0","event_id":"sha256:f64885e2c8a616440c2c68d8b779c71ddabeb0d8f524c1a5f5ddae42458497b6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:6CP233L7TE7S4FUBXO4KIN5R5P","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Instrumenting an SMT Solver to Solve Hybrid Network Reachability Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Alexander Heinz, Christian Schilling, Daniel Bryce, Sergiy Bogomolov","submitted_at":"2016-09-13T14:17:32Z","abstract_excerpt":"PDDL+ planning has its semantics rooted in hybrid automata (HA) and recent work has shown that it can be modeled as a network of HAs. Addressing the complexity of nonlinear PDDL+ planning as HAs requires both space and time efficient reasoning. Unfortunately, existing solvers either do not address nonlinear dynamics or do not natively support networks of automata.\n  We present a new algorithm, called HNSolve, which guides the variable selection of the dReal Satisfiability Modulo Theories (SMT) solver while reasoning about network encodings of nonlinear PDDL+ planning as HAs. HNSolve tightly in"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.03847","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-18T01:04:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"114DEbgwLnVEnljoY3P7ucfsnnfmsvPwrWQddKMRSuQRuWOaWx2atOnZszaJOwpgBwCXLOEsP7OIWioMJV2yCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T16:41:31.383341Z"},"content_sha256":"3704edcda09c8120b5bccd396a0cc96cf622cf3d6187148abc04b29a8e350c0f","schema_version":"1.0","event_id":"sha256:3704edcda09c8120b5bccd396a0cc96cf622cf3d6187148abc04b29a8e350c0f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6CP233L7TE7S4FUBXO4KIN5R5P/bundle.json","state_url":"https://pith.science/pith/6CP233L7TE7S4FUBXO4KIN5R5P/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6CP233L7TE7S4FUBXO4KIN5R5P/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-25T16:41:31Z","links":{"resolver":"https://pith.science/pith/6CP233L7TE7S4FUBXO4KIN5R5P","bundle":"https://pith.science/pith/6CP233L7TE7S4FUBXO4KIN5R5P/bundle.json","state":"https://pith.science/pith/6CP233L7TE7S4FUBXO4KIN5R5P/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6CP233L7TE7S4FUBXO4KIN5R5P/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:6CP233L7TE7S4FUBXO4KIN5R5P","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":"e6590d8d0f52aea05ce08ac97930e8fd764fd3ebf029c51dd18387a060e02dc1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-09-13T14:17:32Z","title_canon_sha256":"1251c82c50a142d9a6db321eac5a0f12df1de1ae6155e44fe9d4bb75aa13547d"},"schema_version":"1.0","source":{"id":"1609.03847","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.03847","created_at":"2026-05-18T01:04:42Z"},{"alias_kind":"arxiv_version","alias_value":"1609.03847v1","created_at":"2026-05-18T01:04:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.03847","created_at":"2026-05-18T01:04:42Z"},{"alias_kind":"pith_short_12","alias_value":"6CP233L7TE7S","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_16","alias_value":"6CP233L7TE7S4FUB","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_8","alias_value":"6CP233L7","created_at":"2026-05-18T12:30:01Z"}],"graph_snapshots":[{"event_id":"sha256:3704edcda09c8120b5bccd396a0cc96cf622cf3d6187148abc04b29a8e350c0f","target":"graph","created_at":"2026-05-18T01:04:42Z","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":"PDDL+ planning has its semantics rooted in hybrid automata (HA) and recent work has shown that it can be modeled as a network of HAs. Addressing the complexity of nonlinear PDDL+ planning as HAs requires both space and time efficient reasoning. Unfortunately, existing solvers either do not address nonlinear dynamics or do not natively support networks of automata.\n  We present a new algorithm, called HNSolve, which guides the variable selection of the dReal Satisfiability Modulo Theories (SMT) solver while reasoning about network encodings of nonlinear PDDL+ planning as HAs. HNSolve tightly in","authors_text":"Alexander Heinz, Christian Schilling, Daniel Bryce, Sergiy Bogomolov","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-09-13T14:17:32Z","title":"Instrumenting an SMT Solver to Solve Hybrid Network Reachability Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.03847","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:f64885e2c8a616440c2c68d8b779c71ddabeb0d8f524c1a5f5ddae42458497b6","target":"record","created_at":"2026-05-18T01:04:42Z","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":"e6590d8d0f52aea05ce08ac97930e8fd764fd3ebf029c51dd18387a060e02dc1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-09-13T14:17:32Z","title_canon_sha256":"1251c82c50a142d9a6db321eac5a0f12df1de1ae6155e44fe9d4bb75aa13547d"},"schema_version":"1.0","source":{"id":"1609.03847","kind":"arxiv","version":1}},"canonical_sha256":"f09faded7f993f2e1681bbb8a437b1ebcd864ba9441c4a7ff453671549b9c676","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f09faded7f993f2e1681bbb8a437b1ebcd864ba9441c4a7ff453671549b9c676","first_computed_at":"2026-05-18T01:04:42.307282Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:04:42.307282Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"d2FfGWdXJCPHwzmLfLEwL2E6Nlde6JWqyFM7NWjv9m0vxmkTSqVhrcZxsZkG7CF165rLMh7qoGvWUZSSuuejDA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:04:42.307836Z","signed_message":"canonical_sha256_bytes"},"source_id":"1609.03847","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f64885e2c8a616440c2c68d8b779c71ddabeb0d8f524c1a5f5ddae42458497b6","sha256:3704edcda09c8120b5bccd396a0cc96cf622cf3d6187148abc04b29a8e350c0f"],"state_sha256":"8a29211ade37e8062c65291794ffc8bda1192e2d0391484d327ab8f89bc9ec1f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+ai5ynBeUzL1QxkBn1iYkUfiP/3H21/st5PF+r+LIQ2bNCeHXVhblw/jIgaSp1EB1TVwt/Ef9+9C/OIARxHNAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T16:41:31.387107Z","bundle_sha256":"a4cb16741d5440ddb80b13a83cfd1d106b2373b249656b94b3d8ec9acf9b0f5b"}}