{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:FCVUWG6762BMZNUHKYJZWITIOU","short_pith_number":"pith:FCVUWG67","schema_version":"1.0","canonical_sha256":"28ab4b1bdff682ccb68756139b2268753c5771ee1b41fd51324df45b2b407bdc","source":{"kind":"arxiv","id":"2507.09324","version":2},"attestation_state":"computed","paper":{"title":"The Network Satisfaction Problem for Relation Algebras with at most 4 Atoms","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":["cs.CC","math.LO"],"primary_cat":"math.RA","authors_text":"Manuel Bodirsky, Mat\\v{e}j Kone\\v{c}n\\'y, Moritz Jahn, Paul Winkler, Simon Kn\\\"auer","submitted_at":"2025-07-12T15:48:27Z","abstract_excerpt":"Andr\\'eka and Maddux classified the relation algebras with at most 3 atoms, and in particular they showed that all of them are representable. Hirsch and Cristiani showed that the network satisfaction problem (NSP) for each of these algebras is in P or NP-hard. The literature contains many results on representations of relation algebras; in particular, some relation algebras with four atoms are not representable. We extend the result of Cristiani and Hirsch to relation algebras with at most 4 atoms: the NSP is always either in P or NP-hard. To this end, we construct universal, fully universal, "},"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":"2507.09324","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"math.RA","submitted_at":"2025-07-12T15:48:27Z","cross_cats_sorted":["cs.CC","math.LO"],"title_canon_sha256":"8cd534558aba23e653568a969ac6b659c81137d6804b0efe62b86fcb34606ff0","abstract_canon_sha256":"9d7176e15e9bca2ee9969f35dd7b81d2e888707e90843993d1890053991d3ce4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-19T16:12:14.215880Z","signature_b64":"5G3njCPpBOoB6BQodmZJltaxx+U9Riv3VLRipoHdFPiJMpB3+3mH+SL2AfXAaO2YisfOyDh6935l41WUk2WdAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"28ab4b1bdff682ccb68756139b2268753c5771ee1b41fd51324df45b2b407bdc","last_reissued_at":"2026-06-19T16:12:14.215442Z","signature_status":"signed_v1","first_computed_at":"2026-06-19T16:12:14.215442Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Network Satisfaction Problem for Relation Algebras with at most 4 Atoms","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":["cs.CC","math.LO"],"primary_cat":"math.RA","authors_text":"Manuel Bodirsky, Mat\\v{e}j Kone\\v{c}n\\'y, Moritz Jahn, Paul Winkler, Simon Kn\\\"auer","submitted_at":"2025-07-12T15:48:27Z","abstract_excerpt":"Andr\\'eka and Maddux classified the relation algebras with at most 3 atoms, and in particular they showed that all of them are representable. Hirsch and Cristiani showed that the network satisfaction problem (NSP) for each of these algebras is in P or NP-hard. The literature contains many results on representations of relation algebras; in particular, some relation algebras with four atoms are not representable. We extend the result of Cristiani and Hirsch to relation algebras with at most 4 atoms: the NSP is always either in P or NP-hard. To this end, we construct universal, fully universal, "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.09324","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/2507.09324/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":"2507.09324","created_at":"2026-06-19T16:12:14.215502+00:00"},{"alias_kind":"arxiv_version","alias_value":"2507.09324v2","created_at":"2026-06-19T16:12:14.215502+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.09324","created_at":"2026-06-19T16:12:14.215502+00:00"},{"alias_kind":"pith_short_12","alias_value":"FCVUWG6762BM","created_at":"2026-06-19T16:12:14.215502+00:00"},{"alias_kind":"pith_short_16","alias_value":"FCVUWG6762BMZNUH","created_at":"2026-06-19T16:12:14.215502+00:00"},{"alias_kind":"pith_short_8","alias_value":"FCVUWG67","created_at":"2026-06-19T16:12:14.215502+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/FCVUWG6762BMZNUHKYJZWITIOU","json":"https://pith.science/pith/FCVUWG6762BMZNUHKYJZWITIOU.json","graph_json":"https://pith.science/api/pith-number/FCVUWG6762BMZNUHKYJZWITIOU/graph.json","events_json":"https://pith.science/api/pith-number/FCVUWG6762BMZNUHKYJZWITIOU/events.json","paper":"https://pith.science/paper/FCVUWG67"},"agent_actions":{"view_html":"https://pith.science/pith/FCVUWG6762BMZNUHKYJZWITIOU","download_json":"https://pith.science/pith/FCVUWG6762BMZNUHKYJZWITIOU.json","view_paper":"https://pith.science/paper/FCVUWG67","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2507.09324&json=true","fetch_graph":"https://pith.science/api/pith-number/FCVUWG6762BMZNUHKYJZWITIOU/graph.json","fetch_events":"https://pith.science/api/pith-number/FCVUWG6762BMZNUHKYJZWITIOU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FCVUWG6762BMZNUHKYJZWITIOU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FCVUWG6762BMZNUHKYJZWITIOU/action/storage_attestation","attest_author":"https://pith.science/pith/FCVUWG6762BMZNUHKYJZWITIOU/action/author_attestation","sign_citation":"https://pith.science/pith/FCVUWG6762BMZNUHKYJZWITIOU/action/citation_signature","submit_replication":"https://pith.science/pith/FCVUWG6762BMZNUHKYJZWITIOU/action/replication_record"}},"created_at":"2026-06-19T16:12:14.215502+00:00","updated_at":"2026-06-19T16:12:14.215502+00:00"}