{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:HBWJT4T562Z7ZHGCWKCYAHLGCW","short_pith_number":"pith:HBWJT4T5","schema_version":"1.0","canonical_sha256":"386c99f27df6b3fc9cc2b285801d66159dcaa59df67b5a37e812215a29409ec9","source":{"kind":"arxiv","id":"1708.01745","version":2},"attestation_state":"computed","paper":{"title":"On the Quest for an Acyclic Graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Mikolas Janota, Radu Grigore, Vasco Manquinho","submitted_at":"2017-08-05T10:28:43Z","abstract_excerpt":"The paper aims at finding acyclic graphs under a given set of constraints. More specifically, given a propositional formula {\\phi} over edges of a fixed-size graph, the objective is to find a model of {\\phi} that corresponds to a graph that is acyclic. The paper proposes several encodings of the problem and compares them in an experimental evaluation using stateof-the-art SAT solvers."},"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":"1708.01745","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2017-08-05T10:28:43Z","cross_cats_sorted":[],"title_canon_sha256":"da8da30f176678171f6edcb96d73c187640ff18a2d15e3c08c6bfcd9ec46f5ac","abstract_canon_sha256":"5077e3abc8393794a6488edbe827e66180dd8600de967bd961a55eb91b661efb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:33:31.812857Z","signature_b64":"9wXueUtzS4q4uNCk+k9zgZ4lm5WRc6qXvonUY9d/FbZu46rLIfbm+o7bHhKVt6G2RvNV+Ep/5F7pZP5rd4EiCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"386c99f27df6b3fc9cc2b285801d66159dcaa59df67b5a37e812215a29409ec9","last_reissued_at":"2026-05-18T00:33:31.812303Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:33:31.812303Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Quest for an Acyclic Graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Mikolas Janota, Radu Grigore, Vasco Manquinho","submitted_at":"2017-08-05T10:28:43Z","abstract_excerpt":"The paper aims at finding acyclic graphs under a given set of constraints. More specifically, given a propositional formula {\\phi} over edges of a fixed-size graph, the objective is to find a model of {\\phi} that corresponds to a graph that is acyclic. The paper proposes several encodings of the problem and compares them in an experimental evaluation using stateof-the-art SAT solvers."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.01745","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":""},"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":"1708.01745","created_at":"2026-05-18T00:33:31.812413+00:00"},{"alias_kind":"arxiv_version","alias_value":"1708.01745v2","created_at":"2026-05-18T00:33:31.812413+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.01745","created_at":"2026-05-18T00:33:31.812413+00:00"},{"alias_kind":"pith_short_12","alias_value":"HBWJT4T562Z7","created_at":"2026-05-18T12:31:18.294218+00:00"},{"alias_kind":"pith_short_16","alias_value":"HBWJT4T562Z7ZHGC","created_at":"2026-05-18T12:31:18.294218+00:00"},{"alias_kind":"pith_short_8","alias_value":"HBWJT4T5","created_at":"2026-05-18T12:31:18.294218+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/HBWJT4T562Z7ZHGCWKCYAHLGCW","json":"https://pith.science/pith/HBWJT4T562Z7ZHGCWKCYAHLGCW.json","graph_json":"https://pith.science/api/pith-number/HBWJT4T562Z7ZHGCWKCYAHLGCW/graph.json","events_json":"https://pith.science/api/pith-number/HBWJT4T562Z7ZHGCWKCYAHLGCW/events.json","paper":"https://pith.science/paper/HBWJT4T5"},"agent_actions":{"view_html":"https://pith.science/pith/HBWJT4T562Z7ZHGCWKCYAHLGCW","download_json":"https://pith.science/pith/HBWJT4T562Z7ZHGCWKCYAHLGCW.json","view_paper":"https://pith.science/paper/HBWJT4T5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1708.01745&json=true","fetch_graph":"https://pith.science/api/pith-number/HBWJT4T562Z7ZHGCWKCYAHLGCW/graph.json","fetch_events":"https://pith.science/api/pith-number/HBWJT4T562Z7ZHGCWKCYAHLGCW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HBWJT4T562Z7ZHGCWKCYAHLGCW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HBWJT4T562Z7ZHGCWKCYAHLGCW/action/storage_attestation","attest_author":"https://pith.science/pith/HBWJT4T562Z7ZHGCWKCYAHLGCW/action/author_attestation","sign_citation":"https://pith.science/pith/HBWJT4T562Z7ZHGCWKCYAHLGCW/action/citation_signature","submit_replication":"https://pith.science/pith/HBWJT4T562Z7ZHGCWKCYAHLGCW/action/replication_record"}},"created_at":"2026-05-18T00:33:31.812413+00:00","updated_at":"2026-05-18T00:33:31.812413+00:00"}