{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:ZE56GBSJANNFPHN26I6QV6O62C","short_pith_number":"pith:ZE56GBSJ","canonical_record":{"source":{"id":"1604.02887","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2016-04-11T11:19:28Z","cross_cats_sorted":[],"title_canon_sha256":"1274af77d9e2beb002e046a968cf96616845a94599c2cd93c9c5f5482bfafc67","abstract_canon_sha256":"79b6e4fa1970582ea60f0a38686a171f84c707056009a19966c9e6dbf1fd49f4"},"schema_version":"1.0"},"canonical_sha256":"c93be30649035a579dbaf23d0af9ded08f147bacd6879c9d80290ede648526ca","source":{"kind":"arxiv","id":"1604.02887","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.02887","created_at":"2026-05-17T23:51:23Z"},{"alias_kind":"arxiv_version","alias_value":"1604.02887v2","created_at":"2026-05-17T23:51:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.02887","created_at":"2026-05-17T23:51:23Z"},{"alias_kind":"pith_short_12","alias_value":"ZE56GBSJANNF","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_16","alias_value":"ZE56GBSJANNFPHN2","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_8","alias_value":"ZE56GBSJ","created_at":"2026-05-18T12:30:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:ZE56GBSJANNFPHN26I6QV6O62C","target":"record","payload":{"canonical_record":{"source":{"id":"1604.02887","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2016-04-11T11:19:28Z","cross_cats_sorted":[],"title_canon_sha256":"1274af77d9e2beb002e046a968cf96616845a94599c2cd93c9c5f5482bfafc67","abstract_canon_sha256":"79b6e4fa1970582ea60f0a38686a171f84c707056009a19966c9e6dbf1fd49f4"},"schema_version":"1.0"},"canonical_sha256":"c93be30649035a579dbaf23d0af9ded08f147bacd6879c9d80290ede648526ca","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:51:23.772554Z","signature_b64":"cDyFwXzhxqqOlQTks/mBqbwy1NH6VpCYo+hhtWJD8OP/GrSO3Z6/pPMCf5ZX01hEE0g6td+61SXZnmWQj3/BCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c93be30649035a579dbaf23d0af9ded08f147bacd6879c9d80290ede648526ca","last_reissued_at":"2026-05-17T23:51:23.771992Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:51:23.771992Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1604.02887","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-17T23:51:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wjGApSuLBOMUFrWGyI275wZrDNQsXQLziQq6uSMLqco1/H+ocw7HdqRXFKJ1l/KBvolGyRehj/bHpz6TbdlCCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T10:02:57.922990Z"},"content_sha256":"5752308ee492a090be4ac5073987f76e823e725c8d42d0d40e2ce7bc689f3a56","schema_version":"1.0","event_id":"sha256:5752308ee492a090be4ac5073987f76e823e725c8d42d0d40e2ce7bc689f3a56"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:ZE56GBSJANNFPHN26I6QV6O62C","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Reasoning about Data Repetitions with Counter Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Diego Figueira, M Praveen, Stephane Demri","submitted_at":"2016-04-11T11:19:28Z","abstract_excerpt":"We study linear-time temporal logics interpreted over data words with multiple attributes. We restrict the atomic formulas to equalities of attribute values in successive positions and to repetitions of attribute values in the future or past. We demonstrate correspondences between satisfiability problems for logics and reachability-like decision problems for counter systems. We show that allowing/disallowing atomic formulas expressing repetitions of values in the past corresponds to the reachability/coverability problem in Petri nets. This gives us 2EXPSPACE upper bounds for several satisfiabi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.02887","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-17T23:51:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bGHGs30e7fOl4eYH6BemWC9ds0cnOenL4yqSD+lg7HB7AVR9nVlnyBxKd8gi4fgEsj6gAwndPCEoCjF03pP9AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T10:02:57.923657Z"},"content_sha256":"1f7a0c876219f3372d261a3dd017e3f309d73bde3e7d4ea40cdd5ebf7f2572c2","schema_version":"1.0","event_id":"sha256:1f7a0c876219f3372d261a3dd017e3f309d73bde3e7d4ea40cdd5ebf7f2572c2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZE56GBSJANNFPHN26I6QV6O62C/bundle.json","state_url":"https://pith.science/pith/ZE56GBSJANNFPHN26I6QV6O62C/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZE56GBSJANNFPHN26I6QV6O62C/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-27T10:02:57Z","links":{"resolver":"https://pith.science/pith/ZE56GBSJANNFPHN26I6QV6O62C","bundle":"https://pith.science/pith/ZE56GBSJANNFPHN26I6QV6O62C/bundle.json","state":"https://pith.science/pith/ZE56GBSJANNFPHN26I6QV6O62C/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZE56GBSJANNFPHN26I6QV6O62C/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:ZE56GBSJANNFPHN26I6QV6O62C","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":"79b6e4fa1970582ea60f0a38686a171f84c707056009a19966c9e6dbf1fd49f4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2016-04-11T11:19:28Z","title_canon_sha256":"1274af77d9e2beb002e046a968cf96616845a94599c2cd93c9c5f5482bfafc67"},"schema_version":"1.0","source":{"id":"1604.02887","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.02887","created_at":"2026-05-17T23:51:23Z"},{"alias_kind":"arxiv_version","alias_value":"1604.02887v2","created_at":"2026-05-17T23:51:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.02887","created_at":"2026-05-17T23:51:23Z"},{"alias_kind":"pith_short_12","alias_value":"ZE56GBSJANNF","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_16","alias_value":"ZE56GBSJANNFPHN2","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_8","alias_value":"ZE56GBSJ","created_at":"2026-05-18T12:30:53Z"}],"graph_snapshots":[{"event_id":"sha256:1f7a0c876219f3372d261a3dd017e3f309d73bde3e7d4ea40cdd5ebf7f2572c2","target":"graph","created_at":"2026-05-17T23:51:23Z","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 study linear-time temporal logics interpreted over data words with multiple attributes. We restrict the atomic formulas to equalities of attribute values in successive positions and to repetitions of attribute values in the future or past. We demonstrate correspondences between satisfiability problems for logics and reachability-like decision problems for counter systems. We show that allowing/disallowing atomic formulas expressing repetitions of values in the past corresponds to the reachability/coverability problem in Petri nets. This gives us 2EXPSPACE upper bounds for several satisfiabi","authors_text":"Diego Figueira, M Praveen, Stephane Demri","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2016-04-11T11:19:28Z","title":"Reasoning about Data Repetitions with Counter Systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.02887","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:5752308ee492a090be4ac5073987f76e823e725c8d42d0d40e2ce7bc689f3a56","target":"record","created_at":"2026-05-17T23:51:23Z","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":"79b6e4fa1970582ea60f0a38686a171f84c707056009a19966c9e6dbf1fd49f4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2016-04-11T11:19:28Z","title_canon_sha256":"1274af77d9e2beb002e046a968cf96616845a94599c2cd93c9c5f5482bfafc67"},"schema_version":"1.0","source":{"id":"1604.02887","kind":"arxiv","version":2}},"canonical_sha256":"c93be30649035a579dbaf23d0af9ded08f147bacd6879c9d80290ede648526ca","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c93be30649035a579dbaf23d0af9ded08f147bacd6879c9d80290ede648526ca","first_computed_at":"2026-05-17T23:51:23.771992Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:51:23.771992Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"cDyFwXzhxqqOlQTks/mBqbwy1NH6VpCYo+hhtWJD8OP/GrSO3Z6/pPMCf5ZX01hEE0g6td+61SXZnmWQj3/BCg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:51:23.772554Z","signed_message":"canonical_sha256_bytes"},"source_id":"1604.02887","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5752308ee492a090be4ac5073987f76e823e725c8d42d0d40e2ce7bc689f3a56","sha256:1f7a0c876219f3372d261a3dd017e3f309d73bde3e7d4ea40cdd5ebf7f2572c2"],"state_sha256":"2c2a51f9763456c7f44e7ba559de696582de7563b4bf04226e0909420d8d7391"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/or758W52ZOkzGZHp4AsdDxn6W9pFDJfGLPjVMKONEYMRIxtLVDZ6JKY0vtjaAmi8eQiFMnQkpbpCDLuNhCTCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T10:02:57.926997Z","bundle_sha256":"eebe8b4630ae54f5a4dfe82c2ec86d24e89ea411638fa501e8467f3a73411e69"}}