{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:NHBXEYUOZRWMAGLUYWOLGTQYFX","short_pith_number":"pith:NHBXEYUO","canonical_record":{"source":{"id":"1609.07667","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.DS","submitted_at":"2016-09-24T20:08:57Z","cross_cats_sorted":[],"title_canon_sha256":"c281ad1d493703273be51d3f3c7b71be15787f9958519c0838d257f0d63cff67","abstract_canon_sha256":"3cf25110d110c3fe2a25cff850a5f4e2e1502a09e1741156db8c2d2771901247"},"schema_version":"1.0"},"canonical_sha256":"69c372628ecc6cc01974c59cb34e182dcffd75ae3de755285c610d836f7d4a00","source":{"kind":"arxiv","id":"1609.07667","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.07667","created_at":"2026-05-18T00:26:18Z"},{"alias_kind":"arxiv_version","alias_value":"1609.07667v1","created_at":"2026-05-18T00:26:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.07667","created_at":"2026-05-18T00:26:18Z"},{"alias_kind":"pith_short_12","alias_value":"NHBXEYUOZRWM","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_16","alias_value":"NHBXEYUOZRWMAGLU","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_8","alias_value":"NHBXEYUO","created_at":"2026-05-18T12:30:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:NHBXEYUOZRWMAGLUYWOLGTQYFX","target":"record","payload":{"canonical_record":{"source":{"id":"1609.07667","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.DS","submitted_at":"2016-09-24T20:08:57Z","cross_cats_sorted":[],"title_canon_sha256":"c281ad1d493703273be51d3f3c7b71be15787f9958519c0838d257f0d63cff67","abstract_canon_sha256":"3cf25110d110c3fe2a25cff850a5f4e2e1502a09e1741156db8c2d2771901247"},"schema_version":"1.0"},"canonical_sha256":"69c372628ecc6cc01974c59cb34e182dcffd75ae3de755285c610d836f7d4a00","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:26:18.505996Z","signature_b64":"3BQxLNtbOg1+44k8r1JS6IlTv2hmQDt59Yg2fRhBsd9+EkH9WodB76QgWf5kaR9AAJp+iBvR4fgJeBeq64MADA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"69c372628ecc6cc01974c59cb34e182dcffd75ae3de755285c610d836f7d4a00","last_reissued_at":"2026-05-18T00:26:18.505463Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:26:18.505463Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1609.07667","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-18T00:26:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"g4dsQq5Zt9ujhrcxu1TGX+3Dxi4/ja2We6+R0c/cpL0rRMrHX4tbZAp14M04K4VJ8E0Jf/nlnHq7QyOqUwkZBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T13:39:16.067228Z"},"content_sha256":"6a34076682f87f94df88fbcddb3078dca3b95eba011ab9b98f7a6807a076f88f","schema_version":"1.0","event_id":"sha256:6a34076682f87f94df88fbcddb3078dca3b95eba011ab9b98f7a6807a076f88f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:NHBXEYUOZRWMAGLUYWOLGTQYFX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A probabilistic heuristic for counting components of functional graphs of polynomials over finite fields","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.DS","authors_text":"Derek Garton, Elisa Bellah, Erin Tannenbaum, Noah Walton","submitted_at":"2016-09-24T20:08:57Z","abstract_excerpt":"In 2014, Flynn and the second author bounded the average number of components of the functional graphs of polynomials of fixed degree over a finite field. When the fixed degree was large (relative to the size of the finite field), their lower bound matched Kruskal's asymptotic for random functional graphs. However, when the fixed degree was small, they were unable to match Krusal's bound, since they could not (Lagrange) interpolate cycles in functional graphs of length greater than the fixed degree. In our work, we introduce a heuristic for approximating the average number of such cycles of an"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.07667","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-18T00:26:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"d7dJbmw0EzTqGfZB222TcBcY2R8vDXrSQvRaeFV9KWMV2t0BKWsCtp6SKLrSgEn7R8qJF6fjLKuIV5uoBM/aAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T13:39:16.067586Z"},"content_sha256":"10739cf8a676d5c137105aca373fd524318d798a4ae556ce924f7a0592bbb34e","schema_version":"1.0","event_id":"sha256:10739cf8a676d5c137105aca373fd524318d798a4ae556ce924f7a0592bbb34e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NHBXEYUOZRWMAGLUYWOLGTQYFX/bundle.json","state_url":"https://pith.science/pith/NHBXEYUOZRWMAGLUYWOLGTQYFX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NHBXEYUOZRWMAGLUYWOLGTQYFX/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-05T13:39:16Z","links":{"resolver":"https://pith.science/pith/NHBXEYUOZRWMAGLUYWOLGTQYFX","bundle":"https://pith.science/pith/NHBXEYUOZRWMAGLUYWOLGTQYFX/bundle.json","state":"https://pith.science/pith/NHBXEYUOZRWMAGLUYWOLGTQYFX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NHBXEYUOZRWMAGLUYWOLGTQYFX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:NHBXEYUOZRWMAGLUYWOLGTQYFX","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":"3cf25110d110c3fe2a25cff850a5f4e2e1502a09e1741156db8c2d2771901247","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.DS","submitted_at":"2016-09-24T20:08:57Z","title_canon_sha256":"c281ad1d493703273be51d3f3c7b71be15787f9958519c0838d257f0d63cff67"},"schema_version":"1.0","source":{"id":"1609.07667","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.07667","created_at":"2026-05-18T00:26:18Z"},{"alias_kind":"arxiv_version","alias_value":"1609.07667v1","created_at":"2026-05-18T00:26:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.07667","created_at":"2026-05-18T00:26:18Z"},{"alias_kind":"pith_short_12","alias_value":"NHBXEYUOZRWM","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_16","alias_value":"NHBXEYUOZRWMAGLU","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_8","alias_value":"NHBXEYUO","created_at":"2026-05-18T12:30:32Z"}],"graph_snapshots":[{"event_id":"sha256:10739cf8a676d5c137105aca373fd524318d798a4ae556ce924f7a0592bbb34e","target":"graph","created_at":"2026-05-18T00:26:18Z","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":"In 2014, Flynn and the second author bounded the average number of components of the functional graphs of polynomials of fixed degree over a finite field. When the fixed degree was large (relative to the size of the finite field), their lower bound matched Kruskal's asymptotic for random functional graphs. However, when the fixed degree was small, they were unable to match Krusal's bound, since they could not (Lagrange) interpolate cycles in functional graphs of length greater than the fixed degree. In our work, we introduce a heuristic for approximating the average number of such cycles of an","authors_text":"Derek Garton, Elisa Bellah, Erin Tannenbaum, Noah Walton","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.DS","submitted_at":"2016-09-24T20:08:57Z","title":"A probabilistic heuristic for counting components of functional graphs of polynomials over finite fields"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.07667","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:6a34076682f87f94df88fbcddb3078dca3b95eba011ab9b98f7a6807a076f88f","target":"record","created_at":"2026-05-18T00:26:18Z","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":"3cf25110d110c3fe2a25cff850a5f4e2e1502a09e1741156db8c2d2771901247","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.DS","submitted_at":"2016-09-24T20:08:57Z","title_canon_sha256":"c281ad1d493703273be51d3f3c7b71be15787f9958519c0838d257f0d63cff67"},"schema_version":"1.0","source":{"id":"1609.07667","kind":"arxiv","version":1}},"canonical_sha256":"69c372628ecc6cc01974c59cb34e182dcffd75ae3de755285c610d836f7d4a00","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"69c372628ecc6cc01974c59cb34e182dcffd75ae3de755285c610d836f7d4a00","first_computed_at":"2026-05-18T00:26:18.505463Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:26:18.505463Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3BQxLNtbOg1+44k8r1JS6IlTv2hmQDt59Yg2fRhBsd9+EkH9WodB76QgWf5kaR9AAJp+iBvR4fgJeBeq64MADA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:26:18.505996Z","signed_message":"canonical_sha256_bytes"},"source_id":"1609.07667","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6a34076682f87f94df88fbcddb3078dca3b95eba011ab9b98f7a6807a076f88f","sha256:10739cf8a676d5c137105aca373fd524318d798a4ae556ce924f7a0592bbb34e"],"state_sha256":"cb72c5909aa3c92ab30a72c5137dcc610da7531c530fe3ac972eea636f99d860"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DGofaN0zw9xprgDRkkIFP8hlBe81fJemCIzxvceBmy7oB2OmBD8WCz8+4HdzBlTVFh6KkFQW8DZ+t9j5vYe/BQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T13:39:16.069493Z","bundle_sha256":"f95fee77cc5548ad07b0e8f3a0805078a002066585d0c98871cf25dd3eef5148"}}