{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:VSXJ32BZBILVKOKWDSNRR6AL6C","short_pith_number":"pith:VSXJ32BZ","canonical_record":{"source":{"id":"1309.2512","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2013-09-10T13:53:27Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"c11d92b4f219ba272c64706f1d3ad71489d29c12f57becdf967f0ff3ad96a9cd","abstract_canon_sha256":"4e98a98408cf0973db5c0cac942f26c2e5c7fa55fd544b469569ad8b46b30a25"},"schema_version":"1.0"},"canonical_sha256":"acae9de8390a175539561c9b18f80bf08c791842958eb19aafee3f1c4d921d31","source":{"kind":"arxiv","id":"1309.2512","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.2512","created_at":"2026-05-18T02:38:17Z"},{"alias_kind":"arxiv_version","alias_value":"1309.2512v2","created_at":"2026-05-18T02:38:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.2512","created_at":"2026-05-18T02:38:17Z"},{"alias_kind":"pith_short_12","alias_value":"VSXJ32BZBILV","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_16","alias_value":"VSXJ32BZBILVKOKW","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_8","alias_value":"VSXJ32BZ","created_at":"2026-05-18T12:28:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:VSXJ32BZBILVKOKWDSNRR6AL6C","target":"record","payload":{"canonical_record":{"source":{"id":"1309.2512","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2013-09-10T13:53:27Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"c11d92b4f219ba272c64706f1d3ad71489d29c12f57becdf967f0ff3ad96a9cd","abstract_canon_sha256":"4e98a98408cf0973db5c0cac942f26c2e5c7fa55fd544b469569ad8b46b30a25"},"schema_version":"1.0"},"canonical_sha256":"acae9de8390a175539561c9b18f80bf08c791842958eb19aafee3f1c4d921d31","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:38:17.067156Z","signature_b64":"0NziAArRYQVnYW1+wCxXkug9RTnLYcB5V9U1hAtQKB3Rqvi0a4GdS5hq+wKdqV/rwSAD0Ru/j8r4FKF5Q+BGBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"acae9de8390a175539561c9b18f80bf08c791842958eb19aafee3f1c4d921d31","last_reissued_at":"2026-05-18T02:38:17.066512Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:38:17.066512Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1309.2512","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:38:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"I6SM2QG7YFIaqBmXQgm6IZZFNKFLCeWaSAEmqIFUDqZ8WYkSBpUkK3kfjYamer2bqXBUddaDwmUW5lvN7gkOBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T22:16:42.430489Z"},"content_sha256":"2af68816e1fbca0bfdf76babf3351da7c9f8c2e3692aa73e365dfb3bd6600c0a","schema_version":"1.0","event_id":"sha256:2af68816e1fbca0bfdf76babf3351da7c9f8c2e3692aa73e365dfb3bd6600c0a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:VSXJ32BZBILVKOKWDSNRR6AL6C","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Enumeration of the adjunctive hierarchy of hereditarily finite sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.LO","authors_text":"Alexandru I. Tomescu, Giorgio Audrito, Stephan Wagner","submitted_at":"2013-09-10T13:53:27Z","abstract_excerpt":"Hereditarily finite sets (sets which are finite and have only hereditarily finite sets as members) are basic mathematical and computational objects, and also stand at the basis of some programming languages. This raises the need for efficient representation of such sets, for example by numbers. In 2008, Kirby proposed an adjunctive hierarchy of hereditarily finite sets, based on the fact that they can also be seen as built up from the empty set by repeated adjunction, that is, by the addition of a new single element drawn from the already existing sets to an already existing set. Determining t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.2512","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:38:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0tJuWVX4ZpgcUjrMi091M3NrYwuen2COilJzTSsrwzqBubxTC70fiNM2liaOasjfxLSGG7YgrZgLzm3ErqgtAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T22:16:42.431213Z"},"content_sha256":"344c896520b1196716928c9419bc7b690ea475740418279acf3570528d56fafc","schema_version":"1.0","event_id":"sha256:344c896520b1196716928c9419bc7b690ea475740418279acf3570528d56fafc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VSXJ32BZBILVKOKWDSNRR6AL6C/bundle.json","state_url":"https://pith.science/pith/VSXJ32BZBILVKOKWDSNRR6AL6C/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VSXJ32BZBILVKOKWDSNRR6AL6C/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-31T22:16:42Z","links":{"resolver":"https://pith.science/pith/VSXJ32BZBILVKOKWDSNRR6AL6C","bundle":"https://pith.science/pith/VSXJ32BZBILVKOKWDSNRR6AL6C/bundle.json","state":"https://pith.science/pith/VSXJ32BZBILVKOKWDSNRR6AL6C/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VSXJ32BZBILVKOKWDSNRR6AL6C/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:VSXJ32BZBILVKOKWDSNRR6AL6C","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":"4e98a98408cf0973db5c0cac942f26c2e5c7fa55fd544b469569ad8b46b30a25","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2013-09-10T13:53:27Z","title_canon_sha256":"c11d92b4f219ba272c64706f1d3ad71489d29c12f57becdf967f0ff3ad96a9cd"},"schema_version":"1.0","source":{"id":"1309.2512","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.2512","created_at":"2026-05-18T02:38:17Z"},{"alias_kind":"arxiv_version","alias_value":"1309.2512v2","created_at":"2026-05-18T02:38:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.2512","created_at":"2026-05-18T02:38:17Z"},{"alias_kind":"pith_short_12","alias_value":"VSXJ32BZBILV","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_16","alias_value":"VSXJ32BZBILVKOKW","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_8","alias_value":"VSXJ32BZ","created_at":"2026-05-18T12:28:04Z"}],"graph_snapshots":[{"event_id":"sha256:344c896520b1196716928c9419bc7b690ea475740418279acf3570528d56fafc","target":"graph","created_at":"2026-05-18T02:38:17Z","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":"Hereditarily finite sets (sets which are finite and have only hereditarily finite sets as members) are basic mathematical and computational objects, and also stand at the basis of some programming languages. This raises the need for efficient representation of such sets, for example by numbers. In 2008, Kirby proposed an adjunctive hierarchy of hereditarily finite sets, based on the fact that they can also be seen as built up from the empty set by repeated adjunction, that is, by the addition of a new single element drawn from the already existing sets to an already existing set. Determining t","authors_text":"Alexandru I. Tomescu, Giorgio Audrito, Stephan Wagner","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2013-09-10T13:53:27Z","title":"Enumeration of the adjunctive hierarchy of hereditarily finite sets"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.2512","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:2af68816e1fbca0bfdf76babf3351da7c9f8c2e3692aa73e365dfb3bd6600c0a","target":"record","created_at":"2026-05-18T02:38:17Z","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":"4e98a98408cf0973db5c0cac942f26c2e5c7fa55fd544b469569ad8b46b30a25","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2013-09-10T13:53:27Z","title_canon_sha256":"c11d92b4f219ba272c64706f1d3ad71489d29c12f57becdf967f0ff3ad96a9cd"},"schema_version":"1.0","source":{"id":"1309.2512","kind":"arxiv","version":2}},"canonical_sha256":"acae9de8390a175539561c9b18f80bf08c791842958eb19aafee3f1c4d921d31","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"acae9de8390a175539561c9b18f80bf08c791842958eb19aafee3f1c4d921d31","first_computed_at":"2026-05-18T02:38:17.066512Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:38:17.066512Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0NziAArRYQVnYW1+wCxXkug9RTnLYcB5V9U1hAtQKB3Rqvi0a4GdS5hq+wKdqV/rwSAD0Ru/j8r4FKF5Q+BGBw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:38:17.067156Z","signed_message":"canonical_sha256_bytes"},"source_id":"1309.2512","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2af68816e1fbca0bfdf76babf3351da7c9f8c2e3692aa73e365dfb3bd6600c0a","sha256:344c896520b1196716928c9419bc7b690ea475740418279acf3570528d56fafc"],"state_sha256":"15f81ad60da64977b0582557bedb2fabf3632ae4b0784e1e4aa50f208f0be84a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zl2C+d/CzOzew4fv/hj+DJu7LKg0isgk+yZbbR7arV7hkPMBSGtP5RT2beRpwzXh7zuibOWx746APQtbI2kmAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T22:16:42.435637Z","bundle_sha256":"05326b0c70c2f55a5c17365cf6569eed6437703f4398b95473188a8bb2007f70"}}