{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:6RNIX6WWWIL5UC53DUHHMCTBQH","short_pith_number":"pith:6RNIX6WW","canonical_record":{"source":{"id":"1304.5806","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2013-04-21T22:10:02Z","cross_cats_sorted":["cs.FL"],"title_canon_sha256":"0155ffb624202ded2d0c1dac942f2949a87843e4e7f830c310960b4f9269da49","abstract_canon_sha256":"061079b178b2fcfd089b331e013e23196f14deb94d0404819c18b96471175fca"},"schema_version":"1.0"},"canonical_sha256":"f45a8bfad6b217da0bbb1d0e760a6181cc1a3119527afd68734d1c18744a8f3f","source":{"kind":"arxiv","id":"1304.5806","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.5806","created_at":"2026-05-18T03:27:24Z"},{"alias_kind":"arxiv_version","alias_value":"1304.5806v1","created_at":"2026-05-18T03:27:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.5806","created_at":"2026-05-18T03:27:24Z"},{"alias_kind":"pith_short_12","alias_value":"6RNIX6WWWIL5","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_16","alias_value":"6RNIX6WWWIL5UC53","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_8","alias_value":"6RNIX6WW","created_at":"2026-05-18T12:27:36Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:6RNIX6WWWIL5UC53DUHHMCTBQH","target":"record","payload":{"canonical_record":{"source":{"id":"1304.5806","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2013-04-21T22:10:02Z","cross_cats_sorted":["cs.FL"],"title_canon_sha256":"0155ffb624202ded2d0c1dac942f2949a87843e4e7f830c310960b4f9269da49","abstract_canon_sha256":"061079b178b2fcfd089b331e013e23196f14deb94d0404819c18b96471175fca"},"schema_version":"1.0"},"canonical_sha256":"f45a8bfad6b217da0bbb1d0e760a6181cc1a3119527afd68734d1c18744a8f3f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:27:24.066411Z","signature_b64":"7jUDjNLa11hs0wYrTPCPKr48NJPLeHzk+5s+iKnmnAdf53cYH+qOhO8a6JhqkaVNkUB+3vZFfpBCAuubzF0jBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f45a8bfad6b217da0bbb1d0e760a6181cc1a3119527afd68734d1c18744a8f3f","last_reissued_at":"2026-05-18T03:27:24.065538Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:27:24.065538Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1304.5806","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-18T03:27:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VyaUHeMuClZBxyJb2u/7UV5x0jLlpoIHPaMGVPSJAZ72UhBqnX7v+4iI2ZXtgn3+Li/g2sLmQw848on53BnMAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T19:56:58.229696Z"},"content_sha256":"95a97823bc74e9c51e02a9fa60d8dfdffd875ff15c90dc57fdb32f955a937846","schema_version":"1.0","event_id":"sha256:95a97823bc74e9c51e02a9fa60d8dfdffd875ff15c90dc57fdb32f955a937846"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:6RNIX6WWWIL5UC53DUHHMCTBQH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fully Automated Shape Analysis Based on Forest Automata","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.FL"],"primary_cat":"cs.LO","authors_text":"Adam Rogalewicz, Jiri Simacek, Lukas Holik, Ondrej Lengal, Tomas Vojnar","submitted_at":"2013-04-21T22:10:02Z","abstract_excerpt":"Forest automata (FA) have recently been proposed as a tool for shape analysis of complex heap structures. FA encode sets of tree decompositions of heap graphs in the form of tuples of tree automata. In order to allow for representing complex heap graphs, the notion of FA allowed one to provide user-defined FA (called boxes) that encode repetitive graph patterns of shape graphs to be used as alphabet symbols of other, higher-level FA. In this paper, we propose a novel technique of automatically learning the FA to be used as boxes that avoids the need of providing them manually. Further, we prop"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.5806","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-18T03:27:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eCrEE59fzxcQJyddovB7VetVG46ByVzeYGiUFwT3cltyHBiTryO9ve/nJoSJ3gUs4CfJFSpeDyu4MSS0kYWfBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T19:56:58.230052Z"},"content_sha256":"baa08bc28c59478a97f2a0edb40196c7ed593cbfb71d904e7ae5d3f5f9d6b0ce","schema_version":"1.0","event_id":"sha256:baa08bc28c59478a97f2a0edb40196c7ed593cbfb71d904e7ae5d3f5f9d6b0ce"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6RNIX6WWWIL5UC53DUHHMCTBQH/bundle.json","state_url":"https://pith.science/pith/6RNIX6WWWIL5UC53DUHHMCTBQH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6RNIX6WWWIL5UC53DUHHMCTBQH/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-03T19:56:58Z","links":{"resolver":"https://pith.science/pith/6RNIX6WWWIL5UC53DUHHMCTBQH","bundle":"https://pith.science/pith/6RNIX6WWWIL5UC53DUHHMCTBQH/bundle.json","state":"https://pith.science/pith/6RNIX6WWWIL5UC53DUHHMCTBQH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6RNIX6WWWIL5UC53DUHHMCTBQH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:6RNIX6WWWIL5UC53DUHHMCTBQH","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":"061079b178b2fcfd089b331e013e23196f14deb94d0404819c18b96471175fca","cross_cats_sorted":["cs.FL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2013-04-21T22:10:02Z","title_canon_sha256":"0155ffb624202ded2d0c1dac942f2949a87843e4e7f830c310960b4f9269da49"},"schema_version":"1.0","source":{"id":"1304.5806","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.5806","created_at":"2026-05-18T03:27:24Z"},{"alias_kind":"arxiv_version","alias_value":"1304.5806v1","created_at":"2026-05-18T03:27:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.5806","created_at":"2026-05-18T03:27:24Z"},{"alias_kind":"pith_short_12","alias_value":"6RNIX6WWWIL5","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_16","alias_value":"6RNIX6WWWIL5UC53","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_8","alias_value":"6RNIX6WW","created_at":"2026-05-18T12:27:36Z"}],"graph_snapshots":[{"event_id":"sha256:baa08bc28c59478a97f2a0edb40196c7ed593cbfb71d904e7ae5d3f5f9d6b0ce","target":"graph","created_at":"2026-05-18T03:27:24Z","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":"Forest automata (FA) have recently been proposed as a tool for shape analysis of complex heap structures. FA encode sets of tree decompositions of heap graphs in the form of tuples of tree automata. In order to allow for representing complex heap graphs, the notion of FA allowed one to provide user-defined FA (called boxes) that encode repetitive graph patterns of shape graphs to be used as alphabet symbols of other, higher-level FA. In this paper, we propose a novel technique of automatically learning the FA to be used as boxes that avoids the need of providing them manually. Further, we prop","authors_text":"Adam Rogalewicz, Jiri Simacek, Lukas Holik, Ondrej Lengal, Tomas Vojnar","cross_cats":["cs.FL"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2013-04-21T22:10:02Z","title":"Fully Automated Shape Analysis Based on Forest Automata"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.5806","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:95a97823bc74e9c51e02a9fa60d8dfdffd875ff15c90dc57fdb32f955a937846","target":"record","created_at":"2026-05-18T03:27:24Z","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":"061079b178b2fcfd089b331e013e23196f14deb94d0404819c18b96471175fca","cross_cats_sorted":["cs.FL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2013-04-21T22:10:02Z","title_canon_sha256":"0155ffb624202ded2d0c1dac942f2949a87843e4e7f830c310960b4f9269da49"},"schema_version":"1.0","source":{"id":"1304.5806","kind":"arxiv","version":1}},"canonical_sha256":"f45a8bfad6b217da0bbb1d0e760a6181cc1a3119527afd68734d1c18744a8f3f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f45a8bfad6b217da0bbb1d0e760a6181cc1a3119527afd68734d1c18744a8f3f","first_computed_at":"2026-05-18T03:27:24.065538Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:27:24.065538Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7jUDjNLa11hs0wYrTPCPKr48NJPLeHzk+5s+iKnmnAdf53cYH+qOhO8a6JhqkaVNkUB+3vZFfpBCAuubzF0jBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:27:24.066411Z","signed_message":"canonical_sha256_bytes"},"source_id":"1304.5806","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:95a97823bc74e9c51e02a9fa60d8dfdffd875ff15c90dc57fdb32f955a937846","sha256:baa08bc28c59478a97f2a0edb40196c7ed593cbfb71d904e7ae5d3f5f9d6b0ce"],"state_sha256":"927977a20889eff208ec8aaf435db7487da6cfac65979504ed2cfdf519b2bfa3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MGuG8X7E+J1Bc3f4Da+jO00IL/HQWMkkwuGzYOuYswviHSN8qs3Ls+UHVbarQs3zR29D9pUz90ZyX9/eOi5oDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T19:56:58.232094Z","bundle_sha256":"93c13796b203787d6dba88ee5e8e1f11c872c47290c1360881e111b095059b42"}}