{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:Z2GQQ55JMIO4XEMO4DJNPHK4TD","short_pith_number":"pith:Z2GQQ55J","canonical_record":{"source":{"id":"2407.14394","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"eess.SY","submitted_at":"2024-07-19T15:16:25Z","cross_cats_sorted":["cs.AI","cs.LO","cs.SY"],"title_canon_sha256":"e63ff10daa658939593e9f6d1040dac2343ae100bc8816f6421601199ca1930d","abstract_canon_sha256":"fca74f91df1a547a46b4346035d732462ab3c80822b113710c100ac8c0ad1a87"},"schema_version":"1.0"},"canonical_sha256":"ce8d0877a9621dcb918ee0d2d79d5c98d6ae0cb6aa46784ae807e35d6fd0099d","source":{"kind":"arxiv","id":"2407.14394","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2407.14394","created_at":"2026-07-05T10:59:01Z"},{"alias_kind":"arxiv_version","alias_value":"2407.14394v2","created_at":"2026-07-05T10:59:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2407.14394","created_at":"2026-07-05T10:59:01Z"},{"alias_kind":"pith_short_12","alias_value":"Z2GQQ55JMIO4","created_at":"2026-07-05T10:59:01Z"},{"alias_kind":"pith_short_16","alias_value":"Z2GQQ55JMIO4XEMO","created_at":"2026-07-05T10:59:01Z"},{"alias_kind":"pith_short_8","alias_value":"Z2GQQ55J","created_at":"2026-07-05T10:59:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:Z2GQQ55JMIO4XEMO4DJNPHK4TD","target":"record","payload":{"canonical_record":{"source":{"id":"2407.14394","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"eess.SY","submitted_at":"2024-07-19T15:16:25Z","cross_cats_sorted":["cs.AI","cs.LO","cs.SY"],"title_canon_sha256":"e63ff10daa658939593e9f6d1040dac2343ae100bc8816f6421601199ca1930d","abstract_canon_sha256":"fca74f91df1a547a46b4346035d732462ab3c80822b113710c100ac8c0ad1a87"},"schema_version":"1.0"},"canonical_sha256":"ce8d0877a9621dcb918ee0d2d79d5c98d6ae0cb6aa46784ae807e35d6fd0099d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:59:01.146086Z","signature_b64":"xJTSoiAXsNlL07xV7r89YyfVKoUGUCtPKPKIz62XKnV2khFQU+NFrpbz8B65+x85frrLVCxqbE+Uf/lkVsmwAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ce8d0877a9621dcb918ee0d2d79d5c98d6ae0cb6aa46784ae807e35d6fd0099d","last_reissued_at":"2026-07-05T10:59:01.145566Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:59:01.145566Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2407.14394","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-07-05T10:59:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2Mv4Lzs+U8jjKYbGlcHF2ARR27litHi/2Y9KyKn0VF6LrYJug3hv4DbpOfLGzgv6lttDl5ywObrAsTTq57S5BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-18T18:00:32.803038Z"},"content_sha256":"e60646a0b271f64647196845b5503df5851b915c0daeecfba775ead34da8d366","schema_version":"1.0","event_id":"sha256:e60646a0b271f64647196845b5503df5851b915c0daeecfba775ead34da8d366"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:Z2GQQ55JMIO4XEMO4DJNPHK4TD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"TTT: A Temporal Refinement Heuristic for Tenuously Tractable Discrete Time Reachability Problems","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.LO","cs.SY"],"primary_cat":"eess.SY","authors_text":"Chelsea Sidrane, Jana Tumova","submitted_at":"2024-07-19T15:16:25Z","abstract_excerpt":"Reachable set computation is an important tool for analyzing control systems. Simulating a control system can show general trends, but a formal tool like reachability analysis can provide guarantees of correctness. Reachability analysis for complex control systems, e.g., with nonlinear dynamics and/or a neural network controller, is often either slow or overly conservative. To address these challenges, much literature has focused on spatial refinement, i.e., tuning the discretization of the input sets and intermediate reachable sets. This paper introduces the idea of temporal refinement: autom"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2407.14394","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2407.14394/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-05T10:59:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bFCyqBjF8IbKoY2EMT8xbR19K0qiFDEcNVO1ckpj4FMR/ZxHySTt72cHhSLqF553T+wpY+MwnpXQ8mES8qqtCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-18T18:00:32.803733Z"},"content_sha256":"b8f2f632d5d221f46e54b6eb10a9c1eabf7b05aaf24628555c202fba8b6ac35f","schema_version":"1.0","event_id":"sha256:b8f2f632d5d221f46e54b6eb10a9c1eabf7b05aaf24628555c202fba8b6ac35f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Z2GQQ55JMIO4XEMO4DJNPHK4TD/bundle.json","state_url":"https://pith.science/pith/Z2GQQ55JMIO4XEMO4DJNPHK4TD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Z2GQQ55JMIO4XEMO4DJNPHK4TD/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-18T18:00:32Z","links":{"resolver":"https://pith.science/pith/Z2GQQ55JMIO4XEMO4DJNPHK4TD","bundle":"https://pith.science/pith/Z2GQQ55JMIO4XEMO4DJNPHK4TD/bundle.json","state":"https://pith.science/pith/Z2GQQ55JMIO4XEMO4DJNPHK4TD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Z2GQQ55JMIO4XEMO4DJNPHK4TD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:Z2GQQ55JMIO4XEMO4DJNPHK4TD","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":"fca74f91df1a547a46b4346035d732462ab3c80822b113710c100ac8c0ad1a87","cross_cats_sorted":["cs.AI","cs.LO","cs.SY"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"eess.SY","submitted_at":"2024-07-19T15:16:25Z","title_canon_sha256":"e63ff10daa658939593e9f6d1040dac2343ae100bc8816f6421601199ca1930d"},"schema_version":"1.0","source":{"id":"2407.14394","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2407.14394","created_at":"2026-07-05T10:59:01Z"},{"alias_kind":"arxiv_version","alias_value":"2407.14394v2","created_at":"2026-07-05T10:59:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2407.14394","created_at":"2026-07-05T10:59:01Z"},{"alias_kind":"pith_short_12","alias_value":"Z2GQQ55JMIO4","created_at":"2026-07-05T10:59:01Z"},{"alias_kind":"pith_short_16","alias_value":"Z2GQQ55JMIO4XEMO","created_at":"2026-07-05T10:59:01Z"},{"alias_kind":"pith_short_8","alias_value":"Z2GQQ55J","created_at":"2026-07-05T10:59:01Z"}],"graph_snapshots":[{"event_id":"sha256:b8f2f632d5d221f46e54b6eb10a9c1eabf7b05aaf24628555c202fba8b6ac35f","target":"graph","created_at":"2026-07-05T10:59:01Z","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/2407.14394/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Reachable set computation is an important tool for analyzing control systems. Simulating a control system can show general trends, but a formal tool like reachability analysis can provide guarantees of correctness. Reachability analysis for complex control systems, e.g., with nonlinear dynamics and/or a neural network controller, is often either slow or overly conservative. To address these challenges, much literature has focused on spatial refinement, i.e., tuning the discretization of the input sets and intermediate reachable sets. This paper introduces the idea of temporal refinement: autom","authors_text":"Chelsea Sidrane, Jana Tumova","cross_cats":["cs.AI","cs.LO","cs.SY"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"eess.SY","submitted_at":"2024-07-19T15:16:25Z","title":"TTT: A Temporal Refinement Heuristic for Tenuously Tractable Discrete Time Reachability Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2407.14394","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:e60646a0b271f64647196845b5503df5851b915c0daeecfba775ead34da8d366","target":"record","created_at":"2026-07-05T10:59:01Z","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":"fca74f91df1a547a46b4346035d732462ab3c80822b113710c100ac8c0ad1a87","cross_cats_sorted":["cs.AI","cs.LO","cs.SY"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"eess.SY","submitted_at":"2024-07-19T15:16:25Z","title_canon_sha256":"e63ff10daa658939593e9f6d1040dac2343ae100bc8816f6421601199ca1930d"},"schema_version":"1.0","source":{"id":"2407.14394","kind":"arxiv","version":2}},"canonical_sha256":"ce8d0877a9621dcb918ee0d2d79d5c98d6ae0cb6aa46784ae807e35d6fd0099d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ce8d0877a9621dcb918ee0d2d79d5c98d6ae0cb6aa46784ae807e35d6fd0099d","first_computed_at":"2026-07-05T10:59:01.145566Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:59:01.145566Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xJTSoiAXsNlL07xV7r89YyfVKoUGUCtPKPKIz62XKnV2khFQU+NFrpbz8B65+x85frrLVCxqbE+Uf/lkVsmwAA==","signature_status":"signed_v1","signed_at":"2026-07-05T10:59:01.146086Z","signed_message":"canonical_sha256_bytes"},"source_id":"2407.14394","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e60646a0b271f64647196845b5503df5851b915c0daeecfba775ead34da8d366","sha256:b8f2f632d5d221f46e54b6eb10a9c1eabf7b05aaf24628555c202fba8b6ac35f"],"state_sha256":"1052d4f8c4a0905184aa94feed6d44343ac1e8cc24734fa054bbb0753748e04f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Hdum1i9dfAhqx9NppE9B9dWz3IZ/7y4cRTElLIWqw+tijAAQTjNs4qNp4dq4ZN3SqqseP3xCEHGSEFHB/OgnBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-18T18:00:32.812689Z","bundle_sha256":"d8bed5b675dcd1ea4ec99f90d029a8fc3f4e5fef256e68f69dec1591018b14a1"}}