{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:BCSJ3LS2GBXIO7DMNYVHP27UGA","short_pith_number":"pith:BCSJ3LS2","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"},"canonical_sha256":"08a49dae5a306e877c6c6e2a77ebf4301a98b6edc67c9d2d4746df40594c5106","source":{"kind":"arxiv","id":"1105.2525","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1105.2525","created_at":"2026-05-18T03:15:57Z"},{"alias_kind":"arxiv_version","alias_value":"1105.2525v3","created_at":"2026-05-18T03:15:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1105.2525","created_at":"2026-05-18T03:15:57Z"},{"alias_kind":"pith_short_12","alias_value":"BCSJ3LS2GBXI","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_16","alias_value":"BCSJ3LS2GBXIO7DM","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_8","alias_value":"BCSJ3LS2","created_at":"2026-05-18T12:26:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:BCSJ3LS2GBXIO7DMNYVHP27UGA","target":"record","payload":{"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"},"canonical_sha256":"08a49dae5a306e877c6c6e2a77ebf4301a98b6edc67c9d2d4746df40594c5106","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"},"source_kind":"arxiv","source_id":"1105.2525","source_version":3,"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-05-18T03:15:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8wt96+PH3vJ0Vrphje7XgiNYsrdklB75aWo07ygQBfIYfR5S3UHg11NDL5Px63ofGvU2biRfwVVH0A17dcGLDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T21:40:10.279805Z"},"content_sha256":"584070061d30934dc7276f4dd3bf43769566d284aa281c35b959f6d775525b55","schema_version":"1.0","event_id":"sha256:584070061d30934dc7276f4dd3bf43769566d284aa281c35b959f6d775525b55"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:BCSJ3LS2GBXIO7DMNYVHP27UGA","target":"graph","payload":{"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"},"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-05-18T03:15:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"x6i7LIt3igQa3Dgiyn0O6YOKjE0BI7gqAbhyKnH+WIL1QmcliZpI9DE5tooz9z19ooA/fdrnT7AMxkcOb6+8Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T21:40:10.280158Z"},"content_sha256":"23731bf0a2319ec9073321cce9b70c58721ebec6f79ff7e16ba8e7d224fdffb1","schema_version":"1.0","event_id":"sha256:23731bf0a2319ec9073321cce9b70c58721ebec6f79ff7e16ba8e7d224fdffb1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BCSJ3LS2GBXIO7DMNYVHP27UGA/bundle.json","state_url":"https://pith.science/pith/BCSJ3LS2GBXIO7DMNYVHP27UGA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BCSJ3LS2GBXIO7DMNYVHP27UGA/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-06-02T21:40:10Z","links":{"resolver":"https://pith.science/pith/BCSJ3LS2GBXIO7DMNYVHP27UGA","bundle":"https://pith.science/pith/BCSJ3LS2GBXIO7DMNYVHP27UGA/bundle.json","state":"https://pith.science/pith/BCSJ3LS2GBXIO7DMNYVHP27UGA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BCSJ3LS2GBXIO7DMNYVHP27UGA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:BCSJ3LS2GBXIO7DMNYVHP27UGA","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":"733e56bb68e156bc27f0cc4d7905cd1733d4e953083f4ed0779fe9d1d2a09852","cross_cats_sorted":["cs.DM","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-05-12T16:34:59Z","title_canon_sha256":"fc1d7317e1272b561c67442bb4c6361d9a35d034a0550f5c116a1a0996561fc2"},"schema_version":"1.0","source":{"id":"1105.2525","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1105.2525","created_at":"2026-05-18T03:15:57Z"},{"alias_kind":"arxiv_version","alias_value":"1105.2525v3","created_at":"2026-05-18T03:15:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1105.2525","created_at":"2026-05-18T03:15:57Z"},{"alias_kind":"pith_short_12","alias_value":"BCSJ3LS2GBXI","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_16","alias_value":"BCSJ3LS2GBXIO7DM","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_8","alias_value":"BCSJ3LS2","created_at":"2026-05-18T12:26:24Z"}],"graph_snapshots":[{"event_id":"sha256:23731bf0a2319ec9073321cce9b70c58721ebec6f79ff7e16ba8e7d224fdffb1","target":"graph","created_at":"2026-05-18T03:15:57Z","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"},"paper":{"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 ","authors_text":"Dirk Oliver Theis, Kathrin Ballerstein","cross_cats":["cs.DM","cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-05-12T16:34:59Z","title":"An algorithm for random signed 3-SAT with Intervals"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1105.2525","kind":"arxiv","version":3},"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:584070061d30934dc7276f4dd3bf43769566d284aa281c35b959f6d775525b55","target":"record","created_at":"2026-05-18T03:15:57Z","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":"733e56bb68e156bc27f0cc4d7905cd1733d4e953083f4ed0779fe9d1d2a09852","cross_cats_sorted":["cs.DM","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-05-12T16:34:59Z","title_canon_sha256":"fc1d7317e1272b561c67442bb4c6361d9a35d034a0550f5c116a1a0996561fc2"},"schema_version":"1.0","source":{"id":"1105.2525","kind":"arxiv","version":3}},"canonical_sha256":"08a49dae5a306e877c6c6e2a77ebf4301a98b6edc67c9d2d4746df40594c5106","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"08a49dae5a306e877c6c6e2a77ebf4301a98b6edc67c9d2d4746df40594c5106","first_computed_at":"2026-05-18T03:15:57.959775Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:15:57.959775Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"nkZej6dKMfipZrO1nZl9HcGybYYC5r/HGynQ9HbMpAizntuPATzMb2jtPNY1kjQCxhGVN0TEuHAHYwJX8NtBDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:15:57.960487Z","signed_message":"canonical_sha256_bytes"},"source_id":"1105.2525","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:584070061d30934dc7276f4dd3bf43769566d284aa281c35b959f6d775525b55","sha256:23731bf0a2319ec9073321cce9b70c58721ebec6f79ff7e16ba8e7d224fdffb1"],"state_sha256":"663fef1c5b31a17b7b239a14d0b4bc5a17abcee8fb3ecf71a339d74d94b89869"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9RFoye0KHoP8DiZAg6FYf19BfWXZN/zwbRn15/00iddxZdgb45rSX6JCrXAjZNMZSMSiwxTR3MahINiPnWvjCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T21:40:10.282162Z","bundle_sha256":"a0ac6cc1beea830ec056d655e64c07693fb8b73f471d9a7026c612483c85604e"}}