{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:2OBSXN6XMOEGXFP3ALWXM3NHRM","short_pith_number":"pith:2OBSXN6X","schema_version":"1.0","canonical_sha256":"d3832bb7d763886b95fb02ed766da78b11b1e6930ad8698529eb88930ee9fd4b","source":{"kind":"arxiv","id":"2511.18639","version":2},"attestation_state":"computed","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."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2511.18639","created_at":"2026-06-30T02:17:11.816407+00:00"},{"alias_kind":"arxiv_version","alias_value":"2511.18639v2","created_at":"2026-06-30T02:17:11.816407+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2511.18639","created_at":"2026-06-30T02:17:11.816407+00:00"},{"alias_kind":"pith_short_12","alias_value":"2OBSXN6XMOEG","created_at":"2026-06-30T02:17:11.816407+00:00"},{"alias_kind":"pith_short_16","alias_value":"2OBSXN6XMOEGXFP3","created_at":"2026-06-30T02:17:11.816407+00:00"},{"alias_kind":"pith_short_8","alias_value":"2OBSXN6X","created_at":"2026-06-30T02:17:11.816407+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/2OBSXN6XMOEGXFP3ALWXM3NHRM","json":"https://pith.science/pith/2OBSXN6XMOEGXFP3ALWXM3NHRM.json","graph_json":"https://pith.science/api/pith-number/2OBSXN6XMOEGXFP3ALWXM3NHRM/graph.json","events_json":"https://pith.science/api/pith-number/2OBSXN6XMOEGXFP3ALWXM3NHRM/events.json","paper":"https://pith.science/paper/2OBSXN6X"},"agent_actions":{"view_html":"https://pith.science/pith/2OBSXN6XMOEGXFP3ALWXM3NHRM","download_json":"https://pith.science/pith/2OBSXN6XMOEGXFP3ALWXM3NHRM.json","view_paper":"https://pith.science/paper/2OBSXN6X","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2511.18639&json=true","fetch_graph":"https://pith.science/api/pith-number/2OBSXN6XMOEGXFP3ALWXM3NHRM/graph.json","fetch_events":"https://pith.science/api/pith-number/2OBSXN6XMOEGXFP3ALWXM3NHRM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2OBSXN6XMOEGXFP3ALWXM3NHRM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2OBSXN6XMOEGXFP3ALWXM3NHRM/action/storage_attestation","attest_author":"https://pith.science/pith/2OBSXN6XMOEGXFP3ALWXM3NHRM/action/author_attestation","sign_citation":"https://pith.science/pith/2OBSXN6XMOEGXFP3ALWXM3NHRM/action/citation_signature","submit_replication":"https://pith.science/pith/2OBSXN6XMOEGXFP3ALWXM3NHRM/action/replication_record"}},"created_at":"2026-06-30T02:17:11.816407+00:00","updated_at":"2026-06-30T02:17:11.816407+00:00"}