{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:2PRPJ5I4Q2IHPET246KQT62GHW","short_pith_number":"pith:2PRPJ5I4","schema_version":"1.0","canonical_sha256":"d3e2f4f51c869077927ae79509fb463dab78f5b6c24617bca63554cf318c50a2","source":{"kind":"arxiv","id":"1203.3249","version":1},"attestation_state":"computed","paper":{"title":"Revisiting the Complexity of And/Or Graph Solution","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"F\\'abio Protti, Maise Dantas da Silva, U\\'everton dos Santos Souza","submitted_at":"2012-03-15T01:16:32Z","abstract_excerpt":"This paper presents a study on two data structures that have been used to model several problems in computer science: and/or graphs and x-y graphs. An and/or graph is an acyclic digraph containing a source, such that every vertex v has a label f(v) \\in {and,or} and edges represent dependency relations between vertices: a vertex labeled and depends on all of its out-neighbors, while a vertex labeled or depends on only one of its out-neighbors. X-y graphs are defined as a natural generalization of and/or graphs: every vertex vi of an x-y graph has a label xi-yi to mean that vi depends on xi of i"},"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":"1203.3249","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2012-03-15T01:16:32Z","cross_cats_sorted":[],"title_canon_sha256":"52792770b87f48b3b4bf737c5af00a5071dd341cfcce479a60a11e8f0a690be4","abstract_canon_sha256":"35db7642e630bb34f8948d35ca9f16178bdce5281e2aa92c18357bf13b8e50da"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:00:02.364263Z","signature_b64":"nz2RfURTIZj/aWEvcvQQ24B5wlX5sYVqAYvpj9oO9xXiwR8mkHVnhfueWoRS45JaA7f46Z7MXmOab9ATs5r2BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d3e2f4f51c869077927ae79509fb463dab78f5b6c24617bca63554cf318c50a2","last_reissued_at":"2026-05-18T04:00:02.363516Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:00:02.363516Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Revisiting the Complexity of And/Or Graph Solution","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"F\\'abio Protti, Maise Dantas da Silva, U\\'everton dos Santos Souza","submitted_at":"2012-03-15T01:16:32Z","abstract_excerpt":"This paper presents a study on two data structures that have been used to model several problems in computer science: and/or graphs and x-y graphs. An and/or graph is an acyclic digraph containing a source, such that every vertex v has a label f(v) \\in {and,or} and edges represent dependency relations between vertices: a vertex labeled and depends on all of its out-neighbors, while a vertex labeled or depends on only one of its out-neighbors. X-y graphs are defined as a natural generalization of and/or graphs: every vertex vi of an x-y graph has a label xi-yi to mean that vi depends on xi of i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.3249","kind":"arxiv","version":1},"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":"1203.3249","created_at":"2026-05-18T04:00:02.363632+00:00"},{"alias_kind":"arxiv_version","alias_value":"1203.3249v1","created_at":"2026-05-18T04:00:02.363632+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.3249","created_at":"2026-05-18T04:00:02.363632+00:00"},{"alias_kind":"pith_short_12","alias_value":"2PRPJ5I4Q2IH","created_at":"2026-05-18T12:26:50.516681+00:00"},{"alias_kind":"pith_short_16","alias_value":"2PRPJ5I4Q2IHPET2","created_at":"2026-05-18T12:26:50.516681+00:00"},{"alias_kind":"pith_short_8","alias_value":"2PRPJ5I4","created_at":"2026-05-18T12:26:50.516681+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/2PRPJ5I4Q2IHPET246KQT62GHW","json":"https://pith.science/pith/2PRPJ5I4Q2IHPET246KQT62GHW.json","graph_json":"https://pith.science/api/pith-number/2PRPJ5I4Q2IHPET246KQT62GHW/graph.json","events_json":"https://pith.science/api/pith-number/2PRPJ5I4Q2IHPET246KQT62GHW/events.json","paper":"https://pith.science/paper/2PRPJ5I4"},"agent_actions":{"view_html":"https://pith.science/pith/2PRPJ5I4Q2IHPET246KQT62GHW","download_json":"https://pith.science/pith/2PRPJ5I4Q2IHPET246KQT62GHW.json","view_paper":"https://pith.science/paper/2PRPJ5I4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1203.3249&json=true","fetch_graph":"https://pith.science/api/pith-number/2PRPJ5I4Q2IHPET246KQT62GHW/graph.json","fetch_events":"https://pith.science/api/pith-number/2PRPJ5I4Q2IHPET246KQT62GHW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2PRPJ5I4Q2IHPET246KQT62GHW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2PRPJ5I4Q2IHPET246KQT62GHW/action/storage_attestation","attest_author":"https://pith.science/pith/2PRPJ5I4Q2IHPET246KQT62GHW/action/author_attestation","sign_citation":"https://pith.science/pith/2PRPJ5I4Q2IHPET246KQT62GHW/action/citation_signature","submit_replication":"https://pith.science/pith/2PRPJ5I4Q2IHPET246KQT62GHW/action/replication_record"}},"created_at":"2026-05-18T04:00:02.363632+00:00","updated_at":"2026-05-18T04:00:02.363632+00:00"}