{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:VIEFA4S7KJS5PI7ZUFATMXLLAW","short_pith_number":"pith:VIEFA4S7","canonical_record":{"source":{"id":"1102.0041","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-01-31T23:59:40Z","cross_cats_sorted":[],"title_canon_sha256":"32b917dde4c995b9a129a34708d6a501570c83f3a83cb4f0487764be052c002a","abstract_canon_sha256":"01962fe2acbf71da14564c282a20fd07d1f3c29cfd84739bd378afd62e5d9adb"},"schema_version":"1.0"},"canonical_sha256":"aa0850725f5265d7a3f9a141365d6b059519d5572157145fcd42c14d27b2286f","source":{"kind":"arxiv","id":"1102.0041","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1102.0041","created_at":"2026-05-18T02:22:41Z"},{"alias_kind":"arxiv_version","alias_value":"1102.0041v2","created_at":"2026-05-18T02:22:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.0041","created_at":"2026-05-18T02:22:41Z"},{"alias_kind":"pith_short_12","alias_value":"VIEFA4S7KJS5","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_16","alias_value":"VIEFA4S7KJS5PI7Z","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_8","alias_value":"VIEFA4S7","created_at":"2026-05-18T12:26:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:VIEFA4S7KJS5PI7ZUFATMXLLAW","target":"record","payload":{"canonical_record":{"source":{"id":"1102.0041","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-01-31T23:59:40Z","cross_cats_sorted":[],"title_canon_sha256":"32b917dde4c995b9a129a34708d6a501570c83f3a83cb4f0487764be052c002a","abstract_canon_sha256":"01962fe2acbf71da14564c282a20fd07d1f3c29cfd84739bd378afd62e5d9adb"},"schema_version":"1.0"},"canonical_sha256":"aa0850725f5265d7a3f9a141365d6b059519d5572157145fcd42c14d27b2286f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:22:41.543797Z","signature_b64":"/0S6Yd2jV2wrOcBHmqSRvkKY9Fa6K0wYhSH0HxOWZ6x3mG4OPOuMrQr8ZT+ywO7rpu4d4/Bl6vNRDJtmQILVAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"aa0850725f5265d7a3f9a141365d6b059519d5572157145fcd42c14d27b2286f","last_reissued_at":"2026-05-18T02:22:41.543272Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:22:41.543272Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1102.0041","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-18T02:22:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UMhsbHucbRCUhxF7uf3nQ4QSDIKwxZjcsIbMeYOOhqroDayBvfH+x++H3JQrht1EHVxmFR1Q1o5Vm33XuJh4Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T14:32:37.506433Z"},"content_sha256":"71696212157b136963ed9de6e7d32fc58ae8d5b80e1c87867eeca26db41ea834","schema_version":"1.0","event_id":"sha256:71696212157b136963ed9de6e7d32fc58ae8d5b80e1c87867eeca26db41ea834"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:VIEFA4S7KJS5PI7ZUFATMXLLAW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Consecutive Ones Property and PQ-Trees for Multisets: Hardness of Counting Their Orderings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Giovanni Battaglia, Noemi Scutell\\`a, Roberto Grossi","submitted_at":"2011-01-31T23:59:40Z","abstract_excerpt":"A binary matrix satisfies the consecutive ones property (COP) if its columns can be permuted such that the ones in each row of the resulting matrix are consecutive. Equivalently, a family of sets F = {Q_1,..,Q_m}, where Q_i is subset of R for some universe R, satisfies the COP if the symbols in R can be permuted such that the elements of each set Q_i occur consecutively, as a contiguous segment of the permutation of R's symbols. We consider the COP version on multisets and prove that counting its solutions is difficult (#P-complete). We prove completeness results also for counting the frontier"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.0041","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-18T02:22:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AwenXi8wpA3hW6X5STEcb/SgA7MlvEdv9gAwe3y0wbyvRgYA/pkuOKlnxlOExAU2mYm4k8MaSP9e4zFm0gtSCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T14:32:37.506925Z"},"content_sha256":"5ccf97f4d0fed973a071e6c41ff03da1c7364ed1857075d7ef6d1228b69c1570","schema_version":"1.0","event_id":"sha256:5ccf97f4d0fed973a071e6c41ff03da1c7364ed1857075d7ef6d1228b69c1570"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VIEFA4S7KJS5PI7ZUFATMXLLAW/bundle.json","state_url":"https://pith.science/pith/VIEFA4S7KJS5PI7ZUFATMXLLAW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VIEFA4S7KJS5PI7ZUFATMXLLAW/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-05-24T14:32:37Z","links":{"resolver":"https://pith.science/pith/VIEFA4S7KJS5PI7ZUFATMXLLAW","bundle":"https://pith.science/pith/VIEFA4S7KJS5PI7ZUFATMXLLAW/bundle.json","state":"https://pith.science/pith/VIEFA4S7KJS5PI7ZUFATMXLLAW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VIEFA4S7KJS5PI7ZUFATMXLLAW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:VIEFA4S7KJS5PI7ZUFATMXLLAW","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":"01962fe2acbf71da14564c282a20fd07d1f3c29cfd84739bd378afd62e5d9adb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-01-31T23:59:40Z","title_canon_sha256":"32b917dde4c995b9a129a34708d6a501570c83f3a83cb4f0487764be052c002a"},"schema_version":"1.0","source":{"id":"1102.0041","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1102.0041","created_at":"2026-05-18T02:22:41Z"},{"alias_kind":"arxiv_version","alias_value":"1102.0041v2","created_at":"2026-05-18T02:22:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.0041","created_at":"2026-05-18T02:22:41Z"},{"alias_kind":"pith_short_12","alias_value":"VIEFA4S7KJS5","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_16","alias_value":"VIEFA4S7KJS5PI7Z","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_8","alias_value":"VIEFA4S7","created_at":"2026-05-18T12:26:44Z"}],"graph_snapshots":[{"event_id":"sha256:5ccf97f4d0fed973a071e6c41ff03da1c7364ed1857075d7ef6d1228b69c1570","target":"graph","created_at":"2026-05-18T02:22:41Z","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":"A binary matrix satisfies the consecutive ones property (COP) if its columns can be permuted such that the ones in each row of the resulting matrix are consecutive. Equivalently, a family of sets F = {Q_1,..,Q_m}, where Q_i is subset of R for some universe R, satisfies the COP if the symbols in R can be permuted such that the elements of each set Q_i occur consecutively, as a contiguous segment of the permutation of R's symbols. We consider the COP version on multisets and prove that counting its solutions is difficult (#P-complete). We prove completeness results also for counting the frontier","authors_text":"Giovanni Battaglia, Noemi Scutell\\`a, Roberto Grossi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-01-31T23:59:40Z","title":"Consecutive Ones Property and PQ-Trees for Multisets: Hardness of Counting Their Orderings"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.0041","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:71696212157b136963ed9de6e7d32fc58ae8d5b80e1c87867eeca26db41ea834","target":"record","created_at":"2026-05-18T02:22:41Z","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":"01962fe2acbf71da14564c282a20fd07d1f3c29cfd84739bd378afd62e5d9adb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-01-31T23:59:40Z","title_canon_sha256":"32b917dde4c995b9a129a34708d6a501570c83f3a83cb4f0487764be052c002a"},"schema_version":"1.0","source":{"id":"1102.0041","kind":"arxiv","version":2}},"canonical_sha256":"aa0850725f5265d7a3f9a141365d6b059519d5572157145fcd42c14d27b2286f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"aa0850725f5265d7a3f9a141365d6b059519d5572157145fcd42c14d27b2286f","first_computed_at":"2026-05-18T02:22:41.543272Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:22:41.543272Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/0S6Yd2jV2wrOcBHmqSRvkKY9Fa6K0wYhSH0HxOWZ6x3mG4OPOuMrQr8ZT+ywO7rpu4d4/Bl6vNRDJtmQILVAA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:22:41.543797Z","signed_message":"canonical_sha256_bytes"},"source_id":"1102.0041","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:71696212157b136963ed9de6e7d32fc58ae8d5b80e1c87867eeca26db41ea834","sha256:5ccf97f4d0fed973a071e6c41ff03da1c7364ed1857075d7ef6d1228b69c1570"],"state_sha256":"80d6cbf47f8c9b07836e0a96443b125e7d26f8815e14df3b37941b190d1b916b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EAFoZE5vnaSJUJkwl2RNFA5N+XgVC0i5ggDrV2l/e2mGhLnbiVy1M/p3dBR5GBUiXig4sQ5rgDYOLd3/HrCZCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-24T14:32:37.510545Z","bundle_sha256":"9e6b92db1c3e012953a2587386318532778c9ceed0be6fd0043a67c1ea7c8c03"}}