{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:BCSJ3LS2GBXIO7DMNYVHP27UGA","short_pith_number":"pith:BCSJ3LS2","schema_version":"1.0","canonical_sha256":"08a49dae5a306e877c6c6e2a77ebf4301a98b6edc67c9d2d4746df40594c5106","source":{"kind":"arxiv","id":"1105.2525","version":3},"attestation_state":"computed","paper":{"title":"An algorithm for random signed 3-SAT with Intervals","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.DS"],"primary_cat":"math.CO","authors_text":"Dirk Oliver Theis, Kathrin Ballerstein","submitted_at":"2011-05-12T16:34:59Z","abstract_excerpt":"In signed k-SAT problems, one fixes a set M and a set $\\mathcal S$ of subsets of M, and is given a formula consisting of a disjunction of m clauses, each of which is a conjunction of k literals. Each literal is of the form \"$x \\in S$\", where $S \\in \\mathcal S$, and x is one of n variables.\n  For Interval-SAT (iSAT), M is an ordered set and $\\mathcal S$ the set of intervals in M.\n  We propose an algorithm for 3-iSAT, and analyze it on uniformly random formulas. The algorithm follows the Unit Clause paradigm, enhanced by a (very limited) backtracking option. Using Wormald's ODE method, we prove "},"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":"1105.2525","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-05-12T16:34:59Z","cross_cats_sorted":["cs.DM","cs.DS"],"title_canon_sha256":"fc1d7317e1272b561c67442bb4c6361d9a35d034a0550f5c116a1a0996561fc2","abstract_canon_sha256":"733e56bb68e156bc27f0cc4d7905cd1733d4e953083f4ed0779fe9d1d2a09852"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:15:57.960487Z","signature_b64":"nkZej6dKMfipZrO1nZl9HcGybYYC5r/HGynQ9HbMpAizntuPATzMb2jtPNY1kjQCxhGVN0TEuHAHYwJX8NtBDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"08a49dae5a306e877c6c6e2a77ebf4301a98b6edc67c9d2d4746df40594c5106","last_reissued_at":"2026-05-18T03:15:57.959775Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:15:57.959775Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An algorithm for random signed 3-SAT with Intervals","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.DS"],"primary_cat":"math.CO","authors_text":"Dirk Oliver Theis, Kathrin Ballerstein","submitted_at":"2011-05-12T16:34:59Z","abstract_excerpt":"In signed k-SAT problems, one fixes a set M and a set $\\mathcal S$ of subsets of M, and is given a formula consisting of a disjunction of m clauses, each of which is a conjunction of k literals. Each literal is of the form \"$x \\in S$\", where $S \\in \\mathcal S$, and x is one of n variables.\n  For Interval-SAT (iSAT), M is an ordered set and $\\mathcal S$ the set of intervals in M.\n  We propose an algorithm for 3-iSAT, and analyze it on uniformly random formulas. The algorithm follows the Unit Clause paradigm, enhanced by a (very limited) backtracking option. Using Wormald's ODE method, we prove "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1105.2525","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":""},"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":"1105.2525","created_at":"2026-05-18T03:15:57.959876+00:00"},{"alias_kind":"arxiv_version","alias_value":"1105.2525v3","created_at":"2026-05-18T03:15:57.959876+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1105.2525","created_at":"2026-05-18T03:15:57.959876+00:00"},{"alias_kind":"pith_short_12","alias_value":"BCSJ3LS2GBXI","created_at":"2026-05-18T12:26:24.575870+00:00"},{"alias_kind":"pith_short_16","alias_value":"BCSJ3LS2GBXIO7DM","created_at":"2026-05-18T12:26:24.575870+00:00"},{"alias_kind":"pith_short_8","alias_value":"BCSJ3LS2","created_at":"2026-05-18T12:26:24.575870+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/BCSJ3LS2GBXIO7DMNYVHP27UGA","json":"https://pith.science/pith/BCSJ3LS2GBXIO7DMNYVHP27UGA.json","graph_json":"https://pith.science/api/pith-number/BCSJ3LS2GBXIO7DMNYVHP27UGA/graph.json","events_json":"https://pith.science/api/pith-number/BCSJ3LS2GBXIO7DMNYVHP27UGA/events.json","paper":"https://pith.science/paper/BCSJ3LS2"},"agent_actions":{"view_html":"https://pith.science/pith/BCSJ3LS2GBXIO7DMNYVHP27UGA","download_json":"https://pith.science/pith/BCSJ3LS2GBXIO7DMNYVHP27UGA.json","view_paper":"https://pith.science/paper/BCSJ3LS2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1105.2525&json=true","fetch_graph":"https://pith.science/api/pith-number/BCSJ3LS2GBXIO7DMNYVHP27UGA/graph.json","fetch_events":"https://pith.science/api/pith-number/BCSJ3LS2GBXIO7DMNYVHP27UGA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BCSJ3LS2GBXIO7DMNYVHP27UGA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BCSJ3LS2GBXIO7DMNYVHP27UGA/action/storage_attestation","attest_author":"https://pith.science/pith/BCSJ3LS2GBXIO7DMNYVHP27UGA/action/author_attestation","sign_citation":"https://pith.science/pith/BCSJ3LS2GBXIO7DMNYVHP27UGA/action/citation_signature","submit_replication":"https://pith.science/pith/BCSJ3LS2GBXIO7DMNYVHP27UGA/action/replication_record"}},"created_at":"2026-05-18T03:15:57.959876+00:00","updated_at":"2026-05-18T03:15:57.959876+00:00"}