{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:TY4S5CQXFCVBIODJBQS3OYYJJL","short_pith_number":"pith:TY4S5CQX","canonical_record":{"source":{"id":"1301.0129","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MS","submitted_at":"2013-01-01T20:10:51Z","cross_cats_sorted":["cs.DM","cs.PL"],"title_canon_sha256":"7ec96599c00f0514d6b61bc8905bd8b618e289c6321dca0fe50fc8de45a1d376","abstract_canon_sha256":"810f21cd9a84dc20c978ed638eb1eb1e65c78b9a67b38a50c3647e820c34c7d4"},"schema_version":"1.0"},"canonical_sha256":"9e392e8a1728aa1438690c25b763094acd624b74e8d9e121f7c5950e8faf117e","source":{"kind":"arxiv","id":"1301.0129","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.0129","created_at":"2026-05-18T03:37:28Z"},{"alias_kind":"arxiv_version","alias_value":"1301.0129v1","created_at":"2026-05-18T03:37:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.0129","created_at":"2026-05-18T03:37:28Z"},{"alias_kind":"pith_short_12","alias_value":"TY4S5CQXFCVB","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_16","alias_value":"TY4S5CQXFCVBIODJ","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_8","alias_value":"TY4S5CQX","created_at":"2026-05-18T12:28:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:TY4S5CQXFCVBIODJBQS3OYYJJL","target":"record","payload":{"canonical_record":{"source":{"id":"1301.0129","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MS","submitted_at":"2013-01-01T20:10:51Z","cross_cats_sorted":["cs.DM","cs.PL"],"title_canon_sha256":"7ec96599c00f0514d6b61bc8905bd8b618e289c6321dca0fe50fc8de45a1d376","abstract_canon_sha256":"810f21cd9a84dc20c978ed638eb1eb1e65c78b9a67b38a50c3647e820c34c7d4"},"schema_version":"1.0"},"canonical_sha256":"9e392e8a1728aa1438690c25b763094acd624b74e8d9e121f7c5950e8faf117e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:37:28.121250Z","signature_b64":"7QNbcWWvn5iKh4lYwyeZqVc+41arQ43pNhChfLZLXum4FJXLeI3sQNZI2UjLgIdbq/Edxdo9iN1ICgmJKAyaBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9e392e8a1728aa1438690c25b763094acd624b74e8d9e121f7c5950e8faf117e","last_reissued_at":"2026-05-18T03:37:28.120519Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:37:28.120519Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1301.0129","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:37:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MjeORx9IXjbC2TTQbb4XtdVwxSPeEDhYCMR87nPT31IE6eB8gBrrfqLdLAVgJxMdWEFOPDUuE4+uudzihtWMDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T11:08:26.172930Z"},"content_sha256":"2c59cb918d6f23a906de1f95063025228aaf947862064c941b6d7a7d58737163","schema_version":"1.0","event_id":"sha256:2c59cb918d6f23a906de1f95063025228aaf947862064c941b6d7a7d58737163"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:TY4S5CQXFCVBIODJBQS3OYYJJL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Two Infinite Families of Pairing Bijections","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.PL"],"primary_cat":"cs.MS","authors_text":"Paul Tarau","submitted_at":"2013-01-01T20:10:51Z","abstract_excerpt":"We describe two general mechanisms for producing pairing bijections (bijective functions defined from N x N to N).\n  The first mechanism, using n-adic valuations results in parameterized algorithms generating a countable family of distinct pairing bijections.\n  The second mechanism, using characteristic functions of subsets of N provides 2^N distinct pairing bijections.\n  Mechanisms to combine such pairing functions and their application to generate families of permutations of N are also described.\n  The paper uses a small subset of the functional language Haskell to provide type checked execu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.0129","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:37:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Fy/wAri8jbEZodfml9edh2aiKedcf0XtjLM9Kc9NFEzsieQsyZuqx18LhIkSnAG/6VYLHcfgEEgbgS5kHreJCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T11:08:26.173333Z"},"content_sha256":"8e5210d19e6cb68e6f06593eda2c592c3ff9806a9c89a7c76e666a49e270bd5e","schema_version":"1.0","event_id":"sha256:8e5210d19e6cb68e6f06593eda2c592c3ff9806a9c89a7c76e666a49e270bd5e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TY4S5CQXFCVBIODJBQS3OYYJJL/bundle.json","state_url":"https://pith.science/pith/TY4S5CQXFCVBIODJBQS3OYYJJL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TY4S5CQXFCVBIODJBQS3OYYJJL/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-25T11:08:26Z","links":{"resolver":"https://pith.science/pith/TY4S5CQXFCVBIODJBQS3OYYJJL","bundle":"https://pith.science/pith/TY4S5CQXFCVBIODJBQS3OYYJJL/bundle.json","state":"https://pith.science/pith/TY4S5CQXFCVBIODJBQS3OYYJJL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TY4S5CQXFCVBIODJBQS3OYYJJL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:TY4S5CQXFCVBIODJBQS3OYYJJL","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":"810f21cd9a84dc20c978ed638eb1eb1e65c78b9a67b38a50c3647e820c34c7d4","cross_cats_sorted":["cs.DM","cs.PL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MS","submitted_at":"2013-01-01T20:10:51Z","title_canon_sha256":"7ec96599c00f0514d6b61bc8905bd8b618e289c6321dca0fe50fc8de45a1d376"},"schema_version":"1.0","source":{"id":"1301.0129","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.0129","created_at":"2026-05-18T03:37:28Z"},{"alias_kind":"arxiv_version","alias_value":"1301.0129v1","created_at":"2026-05-18T03:37:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.0129","created_at":"2026-05-18T03:37:28Z"},{"alias_kind":"pith_short_12","alias_value":"TY4S5CQXFCVB","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_16","alias_value":"TY4S5CQXFCVBIODJ","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_8","alias_value":"TY4S5CQX","created_at":"2026-05-18T12:28:02Z"}],"graph_snapshots":[{"event_id":"sha256:8e5210d19e6cb68e6f06593eda2c592c3ff9806a9c89a7c76e666a49e270bd5e","target":"graph","created_at":"2026-05-18T03:37:28Z","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 describe two general mechanisms for producing pairing bijections (bijective functions defined from N x N to N).\n  The first mechanism, using n-adic valuations results in parameterized algorithms generating a countable family of distinct pairing bijections.\n  The second mechanism, using characteristic functions of subsets of N provides 2^N distinct pairing bijections.\n  Mechanisms to combine such pairing functions and their application to generate families of permutations of N are also described.\n  The paper uses a small subset of the functional language Haskell to provide type checked execu","authors_text":"Paul Tarau","cross_cats":["cs.DM","cs.PL"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MS","submitted_at":"2013-01-01T20:10:51Z","title":"On Two Infinite Families of Pairing Bijections"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.0129","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:2c59cb918d6f23a906de1f95063025228aaf947862064c941b6d7a7d58737163","target":"record","created_at":"2026-05-18T03:37:28Z","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":"810f21cd9a84dc20c978ed638eb1eb1e65c78b9a67b38a50c3647e820c34c7d4","cross_cats_sorted":["cs.DM","cs.PL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MS","submitted_at":"2013-01-01T20:10:51Z","title_canon_sha256":"7ec96599c00f0514d6b61bc8905bd8b618e289c6321dca0fe50fc8de45a1d376"},"schema_version":"1.0","source":{"id":"1301.0129","kind":"arxiv","version":1}},"canonical_sha256":"9e392e8a1728aa1438690c25b763094acd624b74e8d9e121f7c5950e8faf117e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9e392e8a1728aa1438690c25b763094acd624b74e8d9e121f7c5950e8faf117e","first_computed_at":"2026-05-18T03:37:28.120519Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:37:28.120519Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7QNbcWWvn5iKh4lYwyeZqVc+41arQ43pNhChfLZLXum4FJXLeI3sQNZI2UjLgIdbq/Edxdo9iN1ICgmJKAyaBw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:37:28.121250Z","signed_message":"canonical_sha256_bytes"},"source_id":"1301.0129","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2c59cb918d6f23a906de1f95063025228aaf947862064c941b6d7a7d58737163","sha256:8e5210d19e6cb68e6f06593eda2c592c3ff9806a9c89a7c76e666a49e270bd5e"],"state_sha256":"bd16181d05ed07f63af2b47bc7312f5ed1ee7832dc6bee677784f2f75cc2f93d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OeBQVoZ4c7TfxAYYQUvw84zYztuSAfy6kpN2UkmkS4O88v9XpK05Ol9iuXWpWt7SjYcqbhig2WxZlEBtVbuMBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T11:08:26.175295Z","bundle_sha256":"81e82e7dfd1a48ccf1eabf3951f30d7bb90372c5b2cc88cda2aca3a272adcde2"}}