{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:7ZBNOMJSGLVHAL2Z6R5W6SZXYH","short_pith_number":"pith:7ZBNOMJS","canonical_record":{"source":{"id":"2508.20365","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2025-08-28T02:30:02Z","cross_cats_sorted":[],"title_canon_sha256":"aac3eb1c38f1f134a4c830eec68ea23cd7a6895e990d8c19894c66f2ae720dcc","abstract_canon_sha256":"a28c3b17712cae04ee6738f1f889bcb34c4f12bd095e77cc583551144dffa820"},"schema_version":"1.0"},"canonical_sha256":"fe42d7313232ea702f59f47b6f4b37c1fec64254927d0d2717fcb90aa395b96e","source":{"kind":"arxiv","id":"2508.20365","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2508.20365","created_at":"2026-05-27T01:04:50Z"},{"alias_kind":"arxiv_version","alias_value":"2508.20365v3","created_at":"2026-05-27T01:04:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.20365","created_at":"2026-05-27T01:04:50Z"},{"alias_kind":"pith_short_12","alias_value":"7ZBNOMJSGLVH","created_at":"2026-05-27T01:04:50Z"},{"alias_kind":"pith_short_16","alias_value":"7ZBNOMJSGLVHAL2Z","created_at":"2026-05-27T01:04:50Z"},{"alias_kind":"pith_short_8","alias_value":"7ZBNOMJS","created_at":"2026-05-27T01:04:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:7ZBNOMJSGLVHAL2Z6R5W6SZXYH","target":"record","payload":{"canonical_record":{"source":{"id":"2508.20365","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2025-08-28T02:30:02Z","cross_cats_sorted":[],"title_canon_sha256":"aac3eb1c38f1f134a4c830eec68ea23cd7a6895e990d8c19894c66f2ae720dcc","abstract_canon_sha256":"a28c3b17712cae04ee6738f1f889bcb34c4f12bd095e77cc583551144dffa820"},"schema_version":"1.0"},"canonical_sha256":"fe42d7313232ea702f59f47b6f4b37c1fec64254927d0d2717fcb90aa395b96e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-27T01:04:50.168569Z","signature_b64":"ZWjY+MW0Hxr6ZlvS8uLOVkv73Z9ohheFdiG0iveo+X7JFdeQSfCEXr82t8dfTLBTpLMJ0tIGqmp/fDP/TOOWBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fe42d7313232ea702f59f47b6f4b37c1fec64254927d0d2717fcb90aa395b96e","last_reissued_at":"2026-05-27T01:04:50.167596Z","signature_status":"signed_v1","first_computed_at":"2026-05-27T01:04:50.167596Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2508.20365","source_version":3,"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-27T01:04:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eBGp9b/u6OJhvOaeBA0C1mbbHF75lhV0SrFo4hqJv3TYq0WJnJz0Bm2/bU1MYupfyNyNUsGtz0FAuX5Vrv4xDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T07:12:59.805564Z"},"content_sha256":"200c226faaa6c516fa30f0f551e836b84e63677517e4f084ffe73db57e78b2f1","schema_version":"1.0","event_id":"sha256:200c226faaa6c516fa30f0f551e836b84e63677517e4f084ffe73db57e78b2f1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:7ZBNOMJSGLVHAL2Z6R5W6SZXYH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Solvable Tuple Patterns and Their Applications to Program Verification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Ayumi Shinohara, Naoki Kobayashi, Ryosuke Sato, Ryo Yoshinaka","submitted_at":"2025-08-28T02:30:02Z","abstract_excerpt":"Despite the recent progress of automated program verification techniques, fully automated verification of programs manipulating recursive data structures remains a challenge. We introduce solvable tuple patterns (STPs) and conjunctive STPs (CSTPs), novel formalisms for expressing and inferring invariants between list-like recursive data structures. A distinguishing feature of STPs is that they can be efficiently inferred from only a small number of positive samples; no negative samples are required. After presenting properties and inference algorithms of STPs and CSTPs, we show how to incorpor"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2508.20365","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2508.20365/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-27T01:04:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/u2R8HYMu9i8cMdjbc3JruKFh84fg3beSCshG9xrkJekwHcjr5rCU7pE3SOHp8EPtDoMBW9/R81y+Lt+ohA5Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T07:12:59.806261Z"},"content_sha256":"ead3883c4a79c0e06377e0b44143455ba15adb5ef0f1c33201191bbba9d001fa","schema_version":"1.0","event_id":"sha256:ead3883c4a79c0e06377e0b44143455ba15adb5ef0f1c33201191bbba9d001fa"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7ZBNOMJSGLVHAL2Z6R5W6SZXYH/bundle.json","state_url":"https://pith.science/pith/7ZBNOMJSGLVHAL2Z6R5W6SZXYH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7ZBNOMJSGLVHAL2Z6R5W6SZXYH/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-31T07:12:59Z","links":{"resolver":"https://pith.science/pith/7ZBNOMJSGLVHAL2Z6R5W6SZXYH","bundle":"https://pith.science/pith/7ZBNOMJSGLVHAL2Z6R5W6SZXYH/bundle.json","state":"https://pith.science/pith/7ZBNOMJSGLVHAL2Z6R5W6SZXYH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7ZBNOMJSGLVHAL2Z6R5W6SZXYH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:7ZBNOMJSGLVHAL2Z6R5W6SZXYH","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":"a28c3b17712cae04ee6738f1f889bcb34c4f12bd095e77cc583551144dffa820","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2025-08-28T02:30:02Z","title_canon_sha256":"aac3eb1c38f1f134a4c830eec68ea23cd7a6895e990d8c19894c66f2ae720dcc"},"schema_version":"1.0","source":{"id":"2508.20365","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2508.20365","created_at":"2026-05-27T01:04:50Z"},{"alias_kind":"arxiv_version","alias_value":"2508.20365v3","created_at":"2026-05-27T01:04:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.20365","created_at":"2026-05-27T01:04:50Z"},{"alias_kind":"pith_short_12","alias_value":"7ZBNOMJSGLVH","created_at":"2026-05-27T01:04:50Z"},{"alias_kind":"pith_short_16","alias_value":"7ZBNOMJSGLVHAL2Z","created_at":"2026-05-27T01:04:50Z"},{"alias_kind":"pith_short_8","alias_value":"7ZBNOMJS","created_at":"2026-05-27T01:04:50Z"}],"graph_snapshots":[{"event_id":"sha256:ead3883c4a79c0e06377e0b44143455ba15adb5ef0f1c33201191bbba9d001fa","target":"graph","created_at":"2026-05-27T01:04:50Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2508.20365/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Despite the recent progress of automated program verification techniques, fully automated verification of programs manipulating recursive data structures remains a challenge. We introduce solvable tuple patterns (STPs) and conjunctive STPs (CSTPs), novel formalisms for expressing and inferring invariants between list-like recursive data structures. A distinguishing feature of STPs is that they can be efficiently inferred from only a small number of positive samples; no negative samples are required. After presenting properties and inference algorithms of STPs and CSTPs, we show how to incorpor","authors_text":"Ayumi Shinohara, Naoki Kobayashi, Ryosuke Sato, Ryo Yoshinaka","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2025-08-28T02:30:02Z","title":"Solvable Tuple Patterns and Their Applications to Program Verification"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2508.20365","kind":"arxiv","version":3},"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:200c226faaa6c516fa30f0f551e836b84e63677517e4f084ffe73db57e78b2f1","target":"record","created_at":"2026-05-27T01:04:50Z","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":"a28c3b17712cae04ee6738f1f889bcb34c4f12bd095e77cc583551144dffa820","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2025-08-28T02:30:02Z","title_canon_sha256":"aac3eb1c38f1f134a4c830eec68ea23cd7a6895e990d8c19894c66f2ae720dcc"},"schema_version":"1.0","source":{"id":"2508.20365","kind":"arxiv","version":3}},"canonical_sha256":"fe42d7313232ea702f59f47b6f4b37c1fec64254927d0d2717fcb90aa395b96e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fe42d7313232ea702f59f47b6f4b37c1fec64254927d0d2717fcb90aa395b96e","first_computed_at":"2026-05-27T01:04:50.167596Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-27T01:04:50.167596Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZWjY+MW0Hxr6ZlvS8uLOVkv73Z9ohheFdiG0iveo+X7JFdeQSfCEXr82t8dfTLBTpLMJ0tIGqmp/fDP/TOOWBw==","signature_status":"signed_v1","signed_at":"2026-05-27T01:04:50.168569Z","signed_message":"canonical_sha256_bytes"},"source_id":"2508.20365","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:200c226faaa6c516fa30f0f551e836b84e63677517e4f084ffe73db57e78b2f1","sha256:ead3883c4a79c0e06377e0b44143455ba15adb5ef0f1c33201191bbba9d001fa"],"state_sha256":"fb1605dfe428387228dca715cd1be4baff4a604c86b894e823b873a1b3a517b3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GfYg6X5wVSvRrrCDMyPaUZeaqRHzbk9a0dfjc1gRN/3MdHkudJSonu0hfXwKflIvGU0nqmTS8kZuymo+cT5HAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T07:12:59.809833Z","bundle_sha256":"8b93b491317ec6005b4198edc9d17f354c841263dfe5a4557c0c9e9a06ef401b"}}