{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:JLHD3OSTIBFIE2KD3552N5A7AG","short_pith_number":"pith:JLHD3OST","canonical_record":{"source":{"id":"1211.4212","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-11-18T12:00:50Z","cross_cats_sorted":[],"title_canon_sha256":"85e89f98066e48e702ce22a9c67930ef0a78aab98d62ecf9b021ab353e2b6dd9","abstract_canon_sha256":"1f3106965aeeec2a354e909c627a6b5c5c1139ec84fc2e3d94c333cfba840239"},"schema_version":"1.0"},"canonical_sha256":"4ace3dba53404a826943df7ba6f41f019e6b106ad79e95c1cc4c50a77b976af7","source":{"kind":"arxiv","id":"1211.4212","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1211.4212","created_at":"2026-05-18T03:40:15Z"},{"alias_kind":"arxiv_version","alias_value":"1211.4212v2","created_at":"2026-05-18T03:40:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.4212","created_at":"2026-05-18T03:40:15Z"},{"alias_kind":"pith_short_12","alias_value":"JLHD3OSTIBFI","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_16","alias_value":"JLHD3OSTIBFIE2KD","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_8","alias_value":"JLHD3OST","created_at":"2026-05-18T12:27:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:JLHD3OSTIBFIE2KD3552N5A7AG","target":"record","payload":{"canonical_record":{"source":{"id":"1211.4212","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-11-18T12:00:50Z","cross_cats_sorted":[],"title_canon_sha256":"85e89f98066e48e702ce22a9c67930ef0a78aab98d62ecf9b021ab353e2b6dd9","abstract_canon_sha256":"1f3106965aeeec2a354e909c627a6b5c5c1139ec84fc2e3d94c333cfba840239"},"schema_version":"1.0"},"canonical_sha256":"4ace3dba53404a826943df7ba6f41f019e6b106ad79e95c1cc4c50a77b976af7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:40:15.645004Z","signature_b64":"EkfTPVMqhJ2tpJdA1bBJl4JMPpOmvjbHJMx7ZYt1K0KYpZTu6FSlqtyQOQDCPOpVPp//jGGbeBbQRoNSa9MrDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4ace3dba53404a826943df7ba6f41f019e6b106ad79e95c1cc4c50a77b976af7","last_reissued_at":"2026-05-18T03:40:15.644383Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:40:15.644383Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1211.4212","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-18T03:40:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+LPaOu9p35NBTluPIrzSiWJwOHk7E7PczEE0fzMMM3q062rSYNSeNC2SBO+Y2jTkGAMADs7QEwjeYbM04AHlCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T23:22:15.073355Z"},"content_sha256":"0d3a2ee9462386951562209a26a0434e5edfa33b4f7d6e0615692d2efe660cce","schema_version":"1.0","event_id":"sha256:0d3a2ee9462386951562209a26a0434e5edfa33b4f7d6e0615692d2efe660cce"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:JLHD3OSTIBFIE2KD3552N5A7AG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Paths and animals in unbounded degree graphs with repulsion","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Dorota K\\c{e}pa-Maksymowicz, Yuri Kozitsky","submitted_at":"2012-11-18T12:00:50Z","abstract_excerpt":"A class of countable infinite graphs with unbounded vertex degree is considered. In these graphs, the vertices of large degree `repel' each other, which means that the path distance between two such vertices cannot be smaller than a certain function of their degrees. Assuming that this function increases sufficiently fast, we prove that the number of finite connected subgraphs (animals) of order N containing a given vertex x is exponentially bounded in N for N belonging to an infinite subset N_x of natural numbers. Under a less restrictive condition, the same result is obtained for the number "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.4212","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-18T03:40:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"966U15aC2K+LhZ18U2r4JiHyDj53gFhzmex36ATSrU6/9rvPKm7NydW+SBd20P+dCjl4rTy8TvdbcaCtRuZwAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T23:22:15.074063Z"},"content_sha256":"89598db889095e2f5cd1ec866348bc7f2e54c2c83ef1eee162681db53436e2e8","schema_version":"1.0","event_id":"sha256:89598db889095e2f5cd1ec866348bc7f2e54c2c83ef1eee162681db53436e2e8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JLHD3OSTIBFIE2KD3552N5A7AG/bundle.json","state_url":"https://pith.science/pith/JLHD3OSTIBFIE2KD3552N5A7AG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JLHD3OSTIBFIE2KD3552N5A7AG/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-31T23:22:15Z","links":{"resolver":"https://pith.science/pith/JLHD3OSTIBFIE2KD3552N5A7AG","bundle":"https://pith.science/pith/JLHD3OSTIBFIE2KD3552N5A7AG/bundle.json","state":"https://pith.science/pith/JLHD3OSTIBFIE2KD3552N5A7AG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JLHD3OSTIBFIE2KD3552N5A7AG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:JLHD3OSTIBFIE2KD3552N5A7AG","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":"1f3106965aeeec2a354e909c627a6b5c5c1139ec84fc2e3d94c333cfba840239","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-11-18T12:00:50Z","title_canon_sha256":"85e89f98066e48e702ce22a9c67930ef0a78aab98d62ecf9b021ab353e2b6dd9"},"schema_version":"1.0","source":{"id":"1211.4212","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1211.4212","created_at":"2026-05-18T03:40:15Z"},{"alias_kind":"arxiv_version","alias_value":"1211.4212v2","created_at":"2026-05-18T03:40:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.4212","created_at":"2026-05-18T03:40:15Z"},{"alias_kind":"pith_short_12","alias_value":"JLHD3OSTIBFI","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_16","alias_value":"JLHD3OSTIBFIE2KD","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_8","alias_value":"JLHD3OST","created_at":"2026-05-18T12:27:11Z"}],"graph_snapshots":[{"event_id":"sha256:89598db889095e2f5cd1ec866348bc7f2e54c2c83ef1eee162681db53436e2e8","target":"graph","created_at":"2026-05-18T03:40:15Z","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 class of countable infinite graphs with unbounded vertex degree is considered. In these graphs, the vertices of large degree `repel' each other, which means that the path distance between two such vertices cannot be smaller than a certain function of their degrees. Assuming that this function increases sufficiently fast, we prove that the number of finite connected subgraphs (animals) of order N containing a given vertex x is exponentially bounded in N for N belonging to an infinite subset N_x of natural numbers. Under a less restrictive condition, the same result is obtained for the number ","authors_text":"Dorota K\\c{e}pa-Maksymowicz, Yuri Kozitsky","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-11-18T12:00:50Z","title":"Paths and animals in unbounded degree graphs with repulsion"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.4212","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:0d3a2ee9462386951562209a26a0434e5edfa33b4f7d6e0615692d2efe660cce","target":"record","created_at":"2026-05-18T03:40:15Z","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":"1f3106965aeeec2a354e909c627a6b5c5c1139ec84fc2e3d94c333cfba840239","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-11-18T12:00:50Z","title_canon_sha256":"85e89f98066e48e702ce22a9c67930ef0a78aab98d62ecf9b021ab353e2b6dd9"},"schema_version":"1.0","source":{"id":"1211.4212","kind":"arxiv","version":2}},"canonical_sha256":"4ace3dba53404a826943df7ba6f41f019e6b106ad79e95c1cc4c50a77b976af7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4ace3dba53404a826943df7ba6f41f019e6b106ad79e95c1cc4c50a77b976af7","first_computed_at":"2026-05-18T03:40:15.644383Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:40:15.644383Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"EkfTPVMqhJ2tpJdA1bBJl4JMPpOmvjbHJMx7ZYt1K0KYpZTu6FSlqtyQOQDCPOpVPp//jGGbeBbQRoNSa9MrDw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:40:15.645004Z","signed_message":"canonical_sha256_bytes"},"source_id":"1211.4212","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0d3a2ee9462386951562209a26a0434e5edfa33b4f7d6e0615692d2efe660cce","sha256:89598db889095e2f5cd1ec866348bc7f2e54c2c83ef1eee162681db53436e2e8"],"state_sha256":"778bb9159252916ea3a1a9b95cc62de1c6c746488b3e1ca0961375fcb381d3f8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"A5qPVbGzvSdqn7iAVmMvHB8unvvy0VIbP3TqhvvVsMPfYbKjVOVP5SHFf3pWOAD9J/wBra7ZpROAUhWvoKdvCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T23:22:15.078204Z","bundle_sha256":"3ebbe0b3ef85ab6393400e50a00f6bfb1dc8ffdd458494454923bc5ea5ab655e"}}