{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:G4U3EKDOU7HUPVITL2FZ5XCPOM","short_pith_number":"pith:G4U3EKDO","canonical_record":{"source":{"id":"2507.04299","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2025-07-06T08:52:03Z","cross_cats_sorted":[],"title_canon_sha256":"5af2f9cefc138f61ce4312ecb6998aa34272d44e1012bf80852e9bbcb3468051","abstract_canon_sha256":"6dfea2468737c459177da5a6a14b88c41e48758efed04a9e64d5aaf1f6a6eb3b"},"schema_version":"1.0"},"canonical_sha256":"3729b2286ea7cf47d5135e8b9edc4f732ad05e639ed89ef6339394bca28f9d10","source":{"kind":"arxiv","id":"2507.04299","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2507.04299","created_at":"2026-07-05T11:32:45Z"},{"alias_kind":"arxiv_version","alias_value":"2507.04299v1","created_at":"2026-07-05T11:32:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.04299","created_at":"2026-07-05T11:32:45Z"},{"alias_kind":"pith_short_12","alias_value":"G4U3EKDOU7HU","created_at":"2026-07-05T11:32:45Z"},{"alias_kind":"pith_short_16","alias_value":"G4U3EKDOU7HUPVIT","created_at":"2026-07-05T11:32:45Z"},{"alias_kind":"pith_short_8","alias_value":"G4U3EKDO","created_at":"2026-07-05T11:32:45Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:G4U3EKDOU7HUPVITL2FZ5XCPOM","target":"record","payload":{"canonical_record":{"source":{"id":"2507.04299","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2025-07-06T08:52:03Z","cross_cats_sorted":[],"title_canon_sha256":"5af2f9cefc138f61ce4312ecb6998aa34272d44e1012bf80852e9bbcb3468051","abstract_canon_sha256":"6dfea2468737c459177da5a6a14b88c41e48758efed04a9e64d5aaf1f6a6eb3b"},"schema_version":"1.0"},"canonical_sha256":"3729b2286ea7cf47d5135e8b9edc4f732ad05e639ed89ef6339394bca28f9d10","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:32:45.399499Z","signature_b64":"3z3S/4JIa1jpAeTa2WZr/OfhXBNlQxZulbQbEBF9UqoWxzk40GYhyCYIx5N1WxAT2aoy1mKjvZ3YHMGlrP65CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3729b2286ea7cf47d5135e8b9edc4f732ad05e639ed89ef6339394bca28f9d10","last_reissued_at":"2026-07-05T11:32:45.398982Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:32:45.398982Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2507.04299","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-07-05T11:32:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8cChA/r/++QsllRo8u4X/wU+5rBT9RJ7N/cDhx8SX06phVfmmmqzQsmC0n8S1Due6Xnj8u/MZlB3hDB9Z70BDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T11:13:52.676937Z"},"content_sha256":"d8aa2b365df0fd923690c09827af086ff1d3a322f37e22e4587dd5133808bce8","schema_version":"1.0","event_id":"sha256:d8aa2b365df0fd923690c09827af086ff1d3a322f37e22e4587dd5133808bce8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:G4U3EKDOU7HUPVITL2FZ5XCPOM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Answer Set Programming Modulo Theories and Reasoning about Continuous Changes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Joohyung Lee, Yunsong Meng","submitted_at":"2025-07-06T08:52:03Z","abstract_excerpt":"Answer Set Programming Modulo Theories (ASPMT) is a new framework of tight integration of answer set programming (ASP) and satisfiability modulo theories (SMT). Similar to the relationship between first-order logic and SMT, it is based on a recent proposal of the functional stable model semantics by fixing interpretations of background theories. Analogously to a known relationship between ASP and SAT, ``tight'' ASPMT programs can be translated into SMT instances. We demonstrate the usefulness of ASPMT by enhancing action language C+ to handle continuous changes as well as discrete changes. We "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.04299","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2507.04299/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-05T11:32:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bcd5xDc/Tx+WLeAYoYbh9xNoFpZSDkixeq0p5KmJUIdrRvKB86RwxdYgYy3pC9NTYN+PWhIE4msuwTecVFvyCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T11:13:52.677911Z"},"content_sha256":"d9099002cb4c96c2efa61c302de7e56212af03945a700f67ac9e339da30e0808","schema_version":"1.0","event_id":"sha256:d9099002cb4c96c2efa61c302de7e56212af03945a700f67ac9e339da30e0808"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/G4U3EKDOU7HUPVITL2FZ5XCPOM/bundle.json","state_url":"https://pith.science/pith/G4U3EKDOU7HUPVITL2FZ5XCPOM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/G4U3EKDOU7HUPVITL2FZ5XCPOM/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-14T11:13:52Z","links":{"resolver":"https://pith.science/pith/G4U3EKDOU7HUPVITL2FZ5XCPOM","bundle":"https://pith.science/pith/G4U3EKDOU7HUPVITL2FZ5XCPOM/bundle.json","state":"https://pith.science/pith/G4U3EKDOU7HUPVITL2FZ5XCPOM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/G4U3EKDOU7HUPVITL2FZ5XCPOM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:G4U3EKDOU7HUPVITL2FZ5XCPOM","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":"6dfea2468737c459177da5a6a14b88c41e48758efed04a9e64d5aaf1f6a6eb3b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2025-07-06T08:52:03Z","title_canon_sha256":"5af2f9cefc138f61ce4312ecb6998aa34272d44e1012bf80852e9bbcb3468051"},"schema_version":"1.0","source":{"id":"2507.04299","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2507.04299","created_at":"2026-07-05T11:32:45Z"},{"alias_kind":"arxiv_version","alias_value":"2507.04299v1","created_at":"2026-07-05T11:32:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.04299","created_at":"2026-07-05T11:32:45Z"},{"alias_kind":"pith_short_12","alias_value":"G4U3EKDOU7HU","created_at":"2026-07-05T11:32:45Z"},{"alias_kind":"pith_short_16","alias_value":"G4U3EKDOU7HUPVIT","created_at":"2026-07-05T11:32:45Z"},{"alias_kind":"pith_short_8","alias_value":"G4U3EKDO","created_at":"2026-07-05T11:32:45Z"}],"graph_snapshots":[{"event_id":"sha256:d9099002cb4c96c2efa61c302de7e56212af03945a700f67ac9e339da30e0808","target":"graph","created_at":"2026-07-05T11:32:45Z","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/2507.04299/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Answer Set Programming Modulo Theories (ASPMT) is a new framework of tight integration of answer set programming (ASP) and satisfiability modulo theories (SMT). Similar to the relationship between first-order logic and SMT, it is based on a recent proposal of the functional stable model semantics by fixing interpretations of background theories. Analogously to a known relationship between ASP and SAT, ``tight'' ASPMT programs can be translated into SMT instances. We demonstrate the usefulness of ASPMT by enhancing action language C+ to handle continuous changes as well as discrete changes. We ","authors_text":"Joohyung Lee, Yunsong Meng","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2025-07-06T08:52:03Z","title":"Answer Set Programming Modulo Theories and Reasoning about Continuous Changes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.04299","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:d8aa2b365df0fd923690c09827af086ff1d3a322f37e22e4587dd5133808bce8","target":"record","created_at":"2026-07-05T11:32:45Z","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":"6dfea2468737c459177da5a6a14b88c41e48758efed04a9e64d5aaf1f6a6eb3b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2025-07-06T08:52:03Z","title_canon_sha256":"5af2f9cefc138f61ce4312ecb6998aa34272d44e1012bf80852e9bbcb3468051"},"schema_version":"1.0","source":{"id":"2507.04299","kind":"arxiv","version":1}},"canonical_sha256":"3729b2286ea7cf47d5135e8b9edc4f732ad05e639ed89ef6339394bca28f9d10","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3729b2286ea7cf47d5135e8b9edc4f732ad05e639ed89ef6339394bca28f9d10","first_computed_at":"2026-07-05T11:32:45.398982Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:32:45.398982Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3z3S/4JIa1jpAeTa2WZr/OfhXBNlQxZulbQbEBF9UqoWxzk40GYhyCYIx5N1WxAT2aoy1mKjvZ3YHMGlrP65CQ==","signature_status":"signed_v1","signed_at":"2026-07-05T11:32:45.399499Z","signed_message":"canonical_sha256_bytes"},"source_id":"2507.04299","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d8aa2b365df0fd923690c09827af086ff1d3a322f37e22e4587dd5133808bce8","sha256:d9099002cb4c96c2efa61c302de7e56212af03945a700f67ac9e339da30e0808"],"state_sha256":"81be1e0a890518c8184f6a7be425b068dfd3c37162d8b142565ac1e553eb8317"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zxIJIN6Y9OHTZtvnpxXRYCcB7RJzniMLUEyrVWVYKGVGy/GExLK0kIdfo0dH4nhDdzyvZm3QTRvdqp/rR5rnDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-14T11:13:52.684190Z","bundle_sha256":"72aa2e892334fe763319ad1c37c611af7e42d5a846b4c82a70d1163446cbf460"}}