{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:LCQNQ6SALIB6TMNBDTNQN6Q3CN","short_pith_number":"pith:LCQNQ6SA","canonical_record":{"source":{"id":"1303.4443","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-03-18T22:09:37Z","cross_cats_sorted":["cs.DM","cs.LO","math.CO"],"title_canon_sha256":"f27c8aebcb510ab7fb628bcfdd97eba228c22cdd40b2c15fc837119c032fab64","abstract_canon_sha256":"32573fb11cab0cd642efad5a1a619da5e1577dbce849f36aaa9efb1e1475f623"},"schema_version":"1.0"},"canonical_sha256":"58a0d87a405a03e9b1a11cdb06fa1b13693293e2ddb976453f93ac1c524f1aa6","source":{"kind":"arxiv","id":"1303.4443","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1303.4443","created_at":"2026-05-18T03:20:47Z"},{"alias_kind":"arxiv_version","alias_value":"1303.4443v2","created_at":"2026-05-18T03:20:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.4443","created_at":"2026-05-18T03:20:47Z"},{"alias_kind":"pith_short_12","alias_value":"LCQNQ6SALIB6","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_16","alias_value":"LCQNQ6SALIB6TMNB","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_8","alias_value":"LCQNQ6SA","created_at":"2026-05-18T12:27:51Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:LCQNQ6SALIB6TMNBDTNQN6Q3CN","target":"record","payload":{"canonical_record":{"source":{"id":"1303.4443","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-03-18T22:09:37Z","cross_cats_sorted":["cs.DM","cs.LO","math.CO"],"title_canon_sha256":"f27c8aebcb510ab7fb628bcfdd97eba228c22cdd40b2c15fc837119c032fab64","abstract_canon_sha256":"32573fb11cab0cd642efad5a1a619da5e1577dbce849f36aaa9efb1e1475f623"},"schema_version":"1.0"},"canonical_sha256":"58a0d87a405a03e9b1a11cdb06fa1b13693293e2ddb976453f93ac1c524f1aa6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:20:47.934289Z","signature_b64":"xesvD/DKisgf/Ait8FPAT8LwsNgwts9Bk1+Euv85MEKaNDYDetxodqNLkKz7Sq6NHI+UlbMDmxmFy+TaQUO2Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"58a0d87a405a03e9b1a11cdb06fa1b13693293e2ddb976453f93ac1c524f1aa6","last_reissued_at":"2026-05-18T03:20:47.933549Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:20:47.933549Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1303.4443","source_version":2,"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:20:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"huWkI4wblOQ5p/6/eXoe4oz8acsRQ4H2lNC5Up5XqtkCYVIhhVvuYIqju7ze8xIRNigx7LoVf+wKslpnK83tDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T00:50:10.144967Z"},"content_sha256":"54023a311b4fc52e1c9e2db3943222161e05a33b8ca802300ebb39b8d8425b73","schema_version":"1.0","event_id":"sha256:54023a311b4fc52e1c9e2db3943222161e05a33b8ca802300ebb39b8d8425b73"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:LCQNQ6SALIB6TMNBDTNQN6Q3CN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Subgraphs Satisfying MSO Properties on z-Topologically Orderable Digraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.LO","math.CO"],"primary_cat":"cs.CC","authors_text":"Mateus de Oliveira Oliveira","submitted_at":"2013-03-18T22:09:37Z","abstract_excerpt":"We introduce the notion of z-topological orderings for digraphs. We prove that given a digraph G on n vertices admitting a z-topological order- ing, together with such an ordering, one may count the number of subgraphs of G that at the same time satisfy a monadic second order formula {\\phi} and are the union of k directed paths, in time f ({\\phi}, k, z) * n^O(k*z) . Our result implies the polynomial time solvability of many natural counting problems on digraphs admitting z-topological orderings for constant values of z and k. Concerning the relationship between z-topological orderability and o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.4443","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"},"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:20:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4qm50kdTlHJyIJ7sRGHh4zXfEMMy7rzb6Vj1jKrT9qGsr10ajeF019QYtV0xKM3E2vjwlMI1aftEBjige3J0Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T00:50:10.145340Z"},"content_sha256":"cd777bb01c2349b65089a37f39eeae38658bc661950861630f9e65f7b33ecf65","schema_version":"1.0","event_id":"sha256:cd777bb01c2349b65089a37f39eeae38658bc661950861630f9e65f7b33ecf65"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LCQNQ6SALIB6TMNBDTNQN6Q3CN/bundle.json","state_url":"https://pith.science/pith/LCQNQ6SALIB6TMNBDTNQN6Q3CN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LCQNQ6SALIB6TMNBDTNQN6Q3CN/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-02T00:50:10Z","links":{"resolver":"https://pith.science/pith/LCQNQ6SALIB6TMNBDTNQN6Q3CN","bundle":"https://pith.science/pith/LCQNQ6SALIB6TMNBDTNQN6Q3CN/bundle.json","state":"https://pith.science/pith/LCQNQ6SALIB6TMNBDTNQN6Q3CN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LCQNQ6SALIB6TMNBDTNQN6Q3CN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:LCQNQ6SALIB6TMNBDTNQN6Q3CN","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":"32573fb11cab0cd642efad5a1a619da5e1577dbce849f36aaa9efb1e1475f623","cross_cats_sorted":["cs.DM","cs.LO","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-03-18T22:09:37Z","title_canon_sha256":"f27c8aebcb510ab7fb628bcfdd97eba228c22cdd40b2c15fc837119c032fab64"},"schema_version":"1.0","source":{"id":"1303.4443","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1303.4443","created_at":"2026-05-18T03:20:47Z"},{"alias_kind":"arxiv_version","alias_value":"1303.4443v2","created_at":"2026-05-18T03:20:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.4443","created_at":"2026-05-18T03:20:47Z"},{"alias_kind":"pith_short_12","alias_value":"LCQNQ6SALIB6","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_16","alias_value":"LCQNQ6SALIB6TMNB","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_8","alias_value":"LCQNQ6SA","created_at":"2026-05-18T12:27:51Z"}],"graph_snapshots":[{"event_id":"sha256:cd777bb01c2349b65089a37f39eeae38658bc661950861630f9e65f7b33ecf65","target":"graph","created_at":"2026-05-18T03:20:47Z","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":"We introduce the notion of z-topological orderings for digraphs. We prove that given a digraph G on n vertices admitting a z-topological order- ing, together with such an ordering, one may count the number of subgraphs of G that at the same time satisfy a monadic second order formula {\\phi} and are the union of k directed paths, in time f ({\\phi}, k, z) * n^O(k*z) . Our result implies the polynomial time solvability of many natural counting problems on digraphs admitting z-topological orderings for constant values of z and k. Concerning the relationship between z-topological orderability and o","authors_text":"Mateus de Oliveira Oliveira","cross_cats":["cs.DM","cs.LO","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-03-18T22:09:37Z","title":"Subgraphs Satisfying MSO Properties on z-Topologically Orderable Digraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.4443","kind":"arxiv","version":2},"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:54023a311b4fc52e1c9e2db3943222161e05a33b8ca802300ebb39b8d8425b73","target":"record","created_at":"2026-05-18T03:20:47Z","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":"32573fb11cab0cd642efad5a1a619da5e1577dbce849f36aaa9efb1e1475f623","cross_cats_sorted":["cs.DM","cs.LO","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-03-18T22:09:37Z","title_canon_sha256":"f27c8aebcb510ab7fb628bcfdd97eba228c22cdd40b2c15fc837119c032fab64"},"schema_version":"1.0","source":{"id":"1303.4443","kind":"arxiv","version":2}},"canonical_sha256":"58a0d87a405a03e9b1a11cdb06fa1b13693293e2ddb976453f93ac1c524f1aa6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"58a0d87a405a03e9b1a11cdb06fa1b13693293e2ddb976453f93ac1c524f1aa6","first_computed_at":"2026-05-18T03:20:47.933549Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:20:47.933549Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xesvD/DKisgf/Ait8FPAT8LwsNgwts9Bk1+Euv85MEKaNDYDetxodqNLkKz7Sq6NHI+UlbMDmxmFy+TaQUO2Dw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:20:47.934289Z","signed_message":"canonical_sha256_bytes"},"source_id":"1303.4443","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:54023a311b4fc52e1c9e2db3943222161e05a33b8ca802300ebb39b8d8425b73","sha256:cd777bb01c2349b65089a37f39eeae38658bc661950861630f9e65f7b33ecf65"],"state_sha256":"1644c5ccac8c867ed6786b0fa2c5ae0155cf85dfd62f698f022de91ee0374830"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NTsUnnF8H/V8PHzM/aDgPAttoL23CXk577bHPyVliTpjrESVmaLEs/3FCReQ7FesRfY1CMb9mHteypxljZBFCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T00:50:10.147302Z","bundle_sha256":"ed140c7140866d3e3a8acfe9d623fd7dae6b4e00057f105b7acb6a7f47bafebb"}}