{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:2PRPJ5I4Q2IHPET246KQT62GHW","short_pith_number":"pith:2PRPJ5I4","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"},"canonical_sha256":"d3e2f4f51c869077927ae79509fb463dab78f5b6c24617bca63554cf318c50a2","source":{"kind":"arxiv","id":"1203.3249","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1203.3249","created_at":"2026-05-18T04:00:02Z"},{"alias_kind":"arxiv_version","alias_value":"1203.3249v1","created_at":"2026-05-18T04:00:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.3249","created_at":"2026-05-18T04:00:02Z"},{"alias_kind":"pith_short_12","alias_value":"2PRPJ5I4Q2IH","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_16","alias_value":"2PRPJ5I4Q2IHPET2","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_8","alias_value":"2PRPJ5I4","created_at":"2026-05-18T12:26:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:2PRPJ5I4Q2IHPET246KQT62GHW","target":"record","payload":{"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"},"canonical_sha256":"d3e2f4f51c869077927ae79509fb463dab78f5b6c24617bca63554cf318c50a2","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"},"source_kind":"arxiv","source_id":"1203.3249","source_version":1,"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-18T04:00:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GmqlNeKnJXMTh8qPvGtxuvYjiDTE8btrGNg6G11SFRfW43rByDztk6bv1v41OF0ZX6zOYgzL7C/J/NVAibs+CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T06:59:50.400274Z"},"content_sha256":"d49767a84d409963bbc75d4ff98665a98d2830ab532519a680868521d793bbe3","schema_version":"1.0","event_id":"sha256:d49767a84d409963bbc75d4ff98665a98d2830ab532519a680868521d793bbe3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:2PRPJ5I4Q2IHPET246KQT62GHW","target":"graph","payload":{"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"},"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-18T04:00:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gfU2vkEfFA8L8IHQI5PD4XSWjF3vHA8JIiPHJIGH6ubSZxzT4tONsvg1s/NaDY75CIvo6R9gRbepiEHMP9JOCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T06:59:50.400928Z"},"content_sha256":"b18fc1325129471c3619685dc08018673a68768c4cf12961fe73abb06a41e632","schema_version":"1.0","event_id":"sha256:b18fc1325129471c3619685dc08018673a68768c4cf12961fe73abb06a41e632"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2PRPJ5I4Q2IHPET246KQT62GHW/bundle.json","state_url":"https://pith.science/pith/2PRPJ5I4Q2IHPET246KQT62GHW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2PRPJ5I4Q2IHPET246KQT62GHW/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-11T06:59:50Z","links":{"resolver":"https://pith.science/pith/2PRPJ5I4Q2IHPET246KQT62GHW","bundle":"https://pith.science/pith/2PRPJ5I4Q2IHPET246KQT62GHW/bundle.json","state":"https://pith.science/pith/2PRPJ5I4Q2IHPET246KQT62GHW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2PRPJ5I4Q2IHPET246KQT62GHW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:2PRPJ5I4Q2IHPET246KQT62GHW","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":"35db7642e630bb34f8948d35ca9f16178bdce5281e2aa92c18357bf13b8e50da","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2012-03-15T01:16:32Z","title_canon_sha256":"52792770b87f48b3b4bf737c5af00a5071dd341cfcce479a60a11e8f0a690be4"},"schema_version":"1.0","source":{"id":"1203.3249","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1203.3249","created_at":"2026-05-18T04:00:02Z"},{"alias_kind":"arxiv_version","alias_value":"1203.3249v1","created_at":"2026-05-18T04:00:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.3249","created_at":"2026-05-18T04:00:02Z"},{"alias_kind":"pith_short_12","alias_value":"2PRPJ5I4Q2IH","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_16","alias_value":"2PRPJ5I4Q2IHPET2","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_8","alias_value":"2PRPJ5I4","created_at":"2026-05-18T12:26:50Z"}],"graph_snapshots":[{"event_id":"sha256:b18fc1325129471c3619685dc08018673a68768c4cf12961fe73abb06a41e632","target":"graph","created_at":"2026-05-18T04:00:02Z","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":"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","authors_text":"F\\'abio Protti, Maise Dantas da Silva, U\\'everton dos Santos Souza","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2012-03-15T01:16:32Z","title":"Revisiting the Complexity of And/Or Graph Solution"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.3249","kind":"arxiv","version":1},"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:d49767a84d409963bbc75d4ff98665a98d2830ab532519a680868521d793bbe3","target":"record","created_at":"2026-05-18T04:00:02Z","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":"35db7642e630bb34f8948d35ca9f16178bdce5281e2aa92c18357bf13b8e50da","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2012-03-15T01:16:32Z","title_canon_sha256":"52792770b87f48b3b4bf737c5af00a5071dd341cfcce479a60a11e8f0a690be4"},"schema_version":"1.0","source":{"id":"1203.3249","kind":"arxiv","version":1}},"canonical_sha256":"d3e2f4f51c869077927ae79509fb463dab78f5b6c24617bca63554cf318c50a2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d3e2f4f51c869077927ae79509fb463dab78f5b6c24617bca63554cf318c50a2","first_computed_at":"2026-05-18T04:00:02.363516Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:00:02.363516Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"nz2RfURTIZj/aWEvcvQQ24B5wlX5sYVqAYvpj9oO9xXiwR8mkHVnhfueWoRS45JaA7f46Z7MXmOab9ATs5r2BA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:00:02.364263Z","signed_message":"canonical_sha256_bytes"},"source_id":"1203.3249","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d49767a84d409963bbc75d4ff98665a98d2830ab532519a680868521d793bbe3","sha256:b18fc1325129471c3619685dc08018673a68768c4cf12961fe73abb06a41e632"],"state_sha256":"0c603a96111aaa5cd8cc22ebc828735340d41bd37657424810653310e0fcd72e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"J2/i+veyT4nxQKV1rA2u3VBW0jSlxPeJ8P4oEZrxi8w8gSAquF2SeuGXSixxGN3ZNT7XdjYRMn4sYOOYc5GsCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T06:59:50.404794Z","bundle_sha256":"50e944acd2b67c3195a437d963ab46b3698a3424b1720c3117fa044cf4c280c5"}}