{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:FARQ7SOVRIF2FGIPVVHGAFYSUQ","short_pith_number":"pith:FARQ7SOV","schema_version":"1.0","canonical_sha256":"28230fc9d58a0ba2990fad4e601712a4290b817ad0dad12a1327463e3e404f01","source":{"kind":"arxiv","id":"1606.01140","version":3},"attestation_state":"computed","paper":{"title":"The Complexity of Computing all Subfields of an Algebraic Number Field","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.NT"],"primary_cat":"cs.SC","authors_text":"Jonas Szutkoski, Mark van Hoeij","submitted_at":"2016-06-03T15:31:45Z","abstract_excerpt":"For a finite separable field extension K/k, all subfields can be obtained by intersecting so-called principal subfields of K/k. In this work we present a way to quickly compute these intersections. If the number of subfields is high, then this leads to faster run times and an improved complexity."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1606.01140","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2016-06-03T15:31:45Z","cross_cats_sorted":["math.NT"],"title_canon_sha256":"ac829e6e739a86422e9d3b690bfd30c232b8d286b142146b8895a745303c0015","abstract_canon_sha256":"4f0d326b43490ce00cb98487919875d50ae5871ed20891537d7134ee005d9a34"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:30:11.765834Z","signature_b64":"b7cuA9mBK05VGAlEWU4BlY0emZb2Q1EXg6EY4kjUdRghz/xvlKBa+x07H5rJyOGh/kHRJD31shDPEM7Yr1cMAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"28230fc9d58a0ba2990fad4e601712a4290b817ad0dad12a1327463e3e404f01","last_reissued_at":"2026-05-18T00:30:11.765082Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:30:11.765082Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Complexity of Computing all Subfields of an Algebraic Number Field","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.NT"],"primary_cat":"cs.SC","authors_text":"Jonas Szutkoski, Mark van Hoeij","submitted_at":"2016-06-03T15:31:45Z","abstract_excerpt":"For a finite separable field extension K/k, all subfields can be obtained by intersecting so-called principal subfields of K/k. In this work we present a way to quickly compute these intersections. If the number of subfields is high, then this leads to faster run times and an improved complexity."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.01140","kind":"arxiv","version":3},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1606.01140","created_at":"2026-05-18T00:30:11.765206+00:00"},{"alias_kind":"arxiv_version","alias_value":"1606.01140v3","created_at":"2026-05-18T00:30:11.765206+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.01140","created_at":"2026-05-18T00:30:11.765206+00:00"},{"alias_kind":"pith_short_12","alias_value":"FARQ7SOVRIF2","created_at":"2026-05-18T12:30:15.759754+00:00"},{"alias_kind":"pith_short_16","alias_value":"FARQ7SOVRIF2FGIP","created_at":"2026-05-18T12:30:15.759754+00:00"},{"alias_kind":"pith_short_8","alias_value":"FARQ7SOV","created_at":"2026-05-18T12:30:15.759754+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/FARQ7SOVRIF2FGIPVVHGAFYSUQ","json":"https://pith.science/pith/FARQ7SOVRIF2FGIPVVHGAFYSUQ.json","graph_json":"https://pith.science/api/pith-number/FARQ7SOVRIF2FGIPVVHGAFYSUQ/graph.json","events_json":"https://pith.science/api/pith-number/FARQ7SOVRIF2FGIPVVHGAFYSUQ/events.json","paper":"https://pith.science/paper/FARQ7SOV"},"agent_actions":{"view_html":"https://pith.science/pith/FARQ7SOVRIF2FGIPVVHGAFYSUQ","download_json":"https://pith.science/pith/FARQ7SOVRIF2FGIPVVHGAFYSUQ.json","view_paper":"https://pith.science/paper/FARQ7SOV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1606.01140&json=true","fetch_graph":"https://pith.science/api/pith-number/FARQ7SOVRIF2FGIPVVHGAFYSUQ/graph.json","fetch_events":"https://pith.science/api/pith-number/FARQ7SOVRIF2FGIPVVHGAFYSUQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FARQ7SOVRIF2FGIPVVHGAFYSUQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FARQ7SOVRIF2FGIPVVHGAFYSUQ/action/storage_attestation","attest_author":"https://pith.science/pith/FARQ7SOVRIF2FGIPVVHGAFYSUQ/action/author_attestation","sign_citation":"https://pith.science/pith/FARQ7SOVRIF2FGIPVVHGAFYSUQ/action/citation_signature","submit_replication":"https://pith.science/pith/FARQ7SOVRIF2FGIPVVHGAFYSUQ/action/replication_record"}},"created_at":"2026-05-18T00:30:11.765206+00:00","updated_at":"2026-05-18T00:30:11.765206+00:00"}