{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:2OBSXN6XMOEGXFP3ALWXM3NHRM","short_pith_number":"pith:2OBSXN6X","canonical_record":{"source":{"id":"2511.18639","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2025-11-23T22:34:35Z","cross_cats_sorted":[],"title_canon_sha256":"d47dcea647acabc168127756ca7854267fa4dccfb14a67170396d7cefe8225e2","abstract_canon_sha256":"d0e7a4b6d350f52ba4e4fa759cd113eda83281e7d49339d2d40698be69ae6b44"},"schema_version":"1.0"},"canonical_sha256":"d3832bb7d763886b95fb02ed766da78b11b1e6930ad8698529eb88930ee9fd4b","source":{"kind":"arxiv","id":"2511.18639","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2511.18639","created_at":"2026-06-30T02:17:11Z"},{"alias_kind":"arxiv_version","alias_value":"2511.18639v2","created_at":"2026-06-30T02:17:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2511.18639","created_at":"2026-06-30T02:17:11Z"},{"alias_kind":"pith_short_12","alias_value":"2OBSXN6XMOEG","created_at":"2026-06-30T02:17:11Z"},{"alias_kind":"pith_short_16","alias_value":"2OBSXN6XMOEGXFP3","created_at":"2026-06-30T02:17:11Z"},{"alias_kind":"pith_short_8","alias_value":"2OBSXN6X","created_at":"2026-06-30T02:17:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:2OBSXN6XMOEGXFP3ALWXM3NHRM","target":"record","payload":{"canonical_record":{"source":{"id":"2511.18639","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2025-11-23T22:34:35Z","cross_cats_sorted":[],"title_canon_sha256":"d47dcea647acabc168127756ca7854267fa4dccfb14a67170396d7cefe8225e2","abstract_canon_sha256":"d0e7a4b6d350f52ba4e4fa759cd113eda83281e7d49339d2d40698be69ae6b44"},"schema_version":"1.0"},"canonical_sha256":"d3832bb7d763886b95fb02ed766da78b11b1e6930ad8698529eb88930ee9fd4b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-30T02:17:11.816913Z","signature_b64":"jx1/q4RHou2WrD1hH5a3wtUqPUFmQGn3cQyvbxV9NNWcx57C5lmmminxxnBk6cukQcRwwbfkBz3B5/lm5crVDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d3832bb7d763886b95fb02ed766da78b11b1e6930ad8698529eb88930ee9fd4b","last_reissued_at":"2026-06-30T02:17:11.816307Z","signature_status":"signed_v1","first_computed_at":"2026-06-30T02:17:11.816307Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2511.18639","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-06-30T02:17:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NTgttabqtLMqklqWwdpS3beGWGGATLueErrwE/O2pvVMFRPJiGIxYLOr/ZpBSUN/QuwkQSu+oOyFEZ+LCRbnBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T20:37:39.916471Z"},"content_sha256":"afe78c881bf42b85a72de7a80d98816a725d0f3443b62545ff95c6921b11ceb3","schema_version":"1.0","event_id":"sha256:afe78c881bf42b85a72de7a80d98816a725d0f3443b62545ff95c6921b11ceb3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:2OBSXN6XMOEGXFP3ALWXM3NHRM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A SAT-based Approach for Specification, Analysis, and Justification of Reductions between NP-complete Problems","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Predrag Jani\\v{c}i\\'c","submitted_at":"2025-11-23T22:34:35Z","abstract_excerpt":"We propose a novel framework for developing, analyzing, and validating reductions between NP-complete problems. Powered by the SAT-based constraint solver URSA, our methodology introduces several distinct features that set it apart from other related approaches. The proposed workflow effectively bridges the crucial gap between informal, high-level reduction descriptions and formalized mathematical proofs. By supplementing rather than replacing human intuition, this interactive methodology serves as an aid for exploring relationships between NP-complete problems."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2511.18639","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/2511.18639/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-06-30T02:17:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RT4Y9wRa3pL5Uw5HVNRxTZySb7DhOCWje1owXnkfEdxoaGXM/RwBfxXmGnFApGrTTSgUqOmpFWkWU1sL1M4/AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T20:37:39.917076Z"},"content_sha256":"b99af2ecf58492d6017effd1caa5deed67a839603f7b9e4da7f5de091a0e0b05","schema_version":"1.0","event_id":"sha256:b99af2ecf58492d6017effd1caa5deed67a839603f7b9e4da7f5de091a0e0b05"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2OBSXN6XMOEGXFP3ALWXM3NHRM/bundle.json","state_url":"https://pith.science/pith/2OBSXN6XMOEGXFP3ALWXM3NHRM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2OBSXN6XMOEGXFP3ALWXM3NHRM/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-11T20:37:39Z","links":{"resolver":"https://pith.science/pith/2OBSXN6XMOEGXFP3ALWXM3NHRM","bundle":"https://pith.science/pith/2OBSXN6XMOEGXFP3ALWXM3NHRM/bundle.json","state":"https://pith.science/pith/2OBSXN6XMOEGXFP3ALWXM3NHRM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2OBSXN6XMOEGXFP3ALWXM3NHRM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:2OBSXN6XMOEGXFP3ALWXM3NHRM","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":"d0e7a4b6d350f52ba4e4fa759cd113eda83281e7d49339d2d40698be69ae6b44","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2025-11-23T22:34:35Z","title_canon_sha256":"d47dcea647acabc168127756ca7854267fa4dccfb14a67170396d7cefe8225e2"},"schema_version":"1.0","source":{"id":"2511.18639","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2511.18639","created_at":"2026-06-30T02:17:11Z"},{"alias_kind":"arxiv_version","alias_value":"2511.18639v2","created_at":"2026-06-30T02:17:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2511.18639","created_at":"2026-06-30T02:17:11Z"},{"alias_kind":"pith_short_12","alias_value":"2OBSXN6XMOEG","created_at":"2026-06-30T02:17:11Z"},{"alias_kind":"pith_short_16","alias_value":"2OBSXN6XMOEGXFP3","created_at":"2026-06-30T02:17:11Z"},{"alias_kind":"pith_short_8","alias_value":"2OBSXN6X","created_at":"2026-06-30T02:17:11Z"}],"graph_snapshots":[{"event_id":"sha256:b99af2ecf58492d6017effd1caa5deed67a839603f7b9e4da7f5de091a0e0b05","target":"graph","created_at":"2026-06-30T02:17:11Z","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/2511.18639/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We propose a novel framework for developing, analyzing, and validating reductions between NP-complete problems. Powered by the SAT-based constraint solver URSA, our methodology introduces several distinct features that set it apart from other related approaches. The proposed workflow effectively bridges the crucial gap between informal, high-level reduction descriptions and formalized mathematical proofs. By supplementing rather than replacing human intuition, this interactive methodology serves as an aid for exploring relationships between NP-complete problems.","authors_text":"Predrag Jani\\v{c}i\\'c","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2025-11-23T22:34:35Z","title":"A SAT-based Approach for Specification, Analysis, and Justification of Reductions between NP-complete Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2511.18639","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:afe78c881bf42b85a72de7a80d98816a725d0f3443b62545ff95c6921b11ceb3","target":"record","created_at":"2026-06-30T02:17:11Z","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":"d0e7a4b6d350f52ba4e4fa759cd113eda83281e7d49339d2d40698be69ae6b44","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2025-11-23T22:34:35Z","title_canon_sha256":"d47dcea647acabc168127756ca7854267fa4dccfb14a67170396d7cefe8225e2"},"schema_version":"1.0","source":{"id":"2511.18639","kind":"arxiv","version":2}},"canonical_sha256":"d3832bb7d763886b95fb02ed766da78b11b1e6930ad8698529eb88930ee9fd4b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d3832bb7d763886b95fb02ed766da78b11b1e6930ad8698529eb88930ee9fd4b","first_computed_at":"2026-06-30T02:17:11.816307Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-30T02:17:11.816307Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jx1/q4RHou2WrD1hH5a3wtUqPUFmQGn3cQyvbxV9NNWcx57C5lmmminxxnBk6cukQcRwwbfkBz3B5/lm5crVDw==","signature_status":"signed_v1","signed_at":"2026-06-30T02:17:11.816913Z","signed_message":"canonical_sha256_bytes"},"source_id":"2511.18639","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:afe78c881bf42b85a72de7a80d98816a725d0f3443b62545ff95c6921b11ceb3","sha256:b99af2ecf58492d6017effd1caa5deed67a839603f7b9e4da7f5de091a0e0b05"],"state_sha256":"9464c73cf3b73bcbe88adc961544246ade38218afe73cd65f8ba5472ee5242e0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4gk6HtwnmR0bYJkT6R1X0tmWLDrOQdu9dTnJH97pjFDPlBx/cjdx4Q41rRzLNTEtWUgc4v8nnXA7k6gHg8OxDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-11T20:37:39.921382Z","bundle_sha256":"2b64cfce427747abfef1f8ceeeb110d2c32b615e10d39113639917bfa5c96f8c"}}