{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:JWZSKC3FI5RHTUCFSMS2DKTAR3","short_pith_number":"pith:JWZSKC3F","schema_version":"1.0","canonical_sha256":"4db3250b65476279d0459325a1aa608ed8869ac1e207f702267371b01a46d80b","source":{"kind":"arxiv","id":"2401.08668","version":3},"attestation_state":"computed","paper":{"title":"Thermodynamic Perspectives on Computational Complexity: Exploring the P vs. NP Problem","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Florian Neukart","submitted_at":"2023-12-15T06:21:18Z","abstract_excerpt":"The resolution of the P vs. NP problem, a cornerstone in computational theory, remains elusive despite extensive exploration through mathematical logic and algorithmic theory. This paper takes a novel approach by integrating information theory, thermodynamics, and computational complexity, offering a comprehensive landscape of interdisciplinary study. We focus on entropy, a concept traditionally linked with uncertainty and disorder, and reinterpret it to assess the complexity of computational problems. Our research presents a structured framework for establishing entropy profiles within comput"},"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":"2401.08668","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2023-12-15T06:21:18Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"48c6ee1ec22c29ccb4be86959138a829ae39deaf7edc085074125c642ea88d4f","abstract_canon_sha256":"0ea203ada8403af2d59135a412b0db3b9311680a1acb24b079b76095dee9a1b7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:56:58.589264Z","signature_b64":"1tuSZl1fyEBnKE3gILBcSBkXsK5IaHIQ1Rv507e/urFRJ5lasUpmvJVk/e4K07M3e4GUkHCCHSM2houoPC1RCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4db3250b65476279d0459325a1aa608ed8869ac1e207f702267371b01a46d80b","last_reissued_at":"2026-07-05T07:56:58.588909Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:56:58.588909Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Thermodynamic Perspectives on Computational Complexity: Exploring the P vs. NP Problem","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Florian Neukart","submitted_at":"2023-12-15T06:21:18Z","abstract_excerpt":"The resolution of the P vs. NP problem, a cornerstone in computational theory, remains elusive despite extensive exploration through mathematical logic and algorithmic theory. This paper takes a novel approach by integrating information theory, thermodynamics, and computational complexity, offering a comprehensive landscape of interdisciplinary study. We focus on entropy, a concept traditionally linked with uncertainty and disorder, and reinterpret it to assess the complexity of computational problems. Our research presents a structured framework for establishing entropy profiles within comput"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2401.08668","kind":"arxiv","version":3},"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/2401.08668/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":"2401.08668","created_at":"2026-07-05T07:56:58.588964+00:00"},{"alias_kind":"arxiv_version","alias_value":"2401.08668v3","created_at":"2026-07-05T07:56:58.588964+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2401.08668","created_at":"2026-07-05T07:56:58.588964+00:00"},{"alias_kind":"pith_short_12","alias_value":"JWZSKC3FI5RH","created_at":"2026-07-05T07:56:58.588964+00:00"},{"alias_kind":"pith_short_16","alias_value":"JWZSKC3FI5RHTUCF","created_at":"2026-07-05T07:56:58.588964+00:00"},{"alias_kind":"pith_short_8","alias_value":"JWZSKC3F","created_at":"2026-07-05T07:56:58.588964+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2501.10480","citing_title":"The sliding tile puzzle, roots to polynomials, and $\\textbf{P}$ vs. $\\textbf{NP}$ complexity","ref_index":82,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/JWZSKC3FI5RHTUCFSMS2DKTAR3","json":"https://pith.science/pith/JWZSKC3FI5RHTUCFSMS2DKTAR3.json","graph_json":"https://pith.science/api/pith-number/JWZSKC3FI5RHTUCFSMS2DKTAR3/graph.json","events_json":"https://pith.science/api/pith-number/JWZSKC3FI5RHTUCFSMS2DKTAR3/events.json","paper":"https://pith.science/paper/JWZSKC3F"},"agent_actions":{"view_html":"https://pith.science/pith/JWZSKC3FI5RHTUCFSMS2DKTAR3","download_json":"https://pith.science/pith/JWZSKC3FI5RHTUCFSMS2DKTAR3.json","view_paper":"https://pith.science/paper/JWZSKC3F","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2401.08668&json=true","fetch_graph":"https://pith.science/api/pith-number/JWZSKC3FI5RHTUCFSMS2DKTAR3/graph.json","fetch_events":"https://pith.science/api/pith-number/JWZSKC3FI5RHTUCFSMS2DKTAR3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JWZSKC3FI5RHTUCFSMS2DKTAR3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JWZSKC3FI5RHTUCFSMS2DKTAR3/action/storage_attestation","attest_author":"https://pith.science/pith/JWZSKC3FI5RHTUCFSMS2DKTAR3/action/author_attestation","sign_citation":"https://pith.science/pith/JWZSKC3FI5RHTUCFSMS2DKTAR3/action/citation_signature","submit_replication":"https://pith.science/pith/JWZSKC3FI5RHTUCFSMS2DKTAR3/action/replication_record"}},"created_at":"2026-07-05T07:56:58.588964+00:00","updated_at":"2026-07-05T07:56:58.588964+00:00"}