{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:UMABFLINZZWO4RK4QFEKZ4K3MY","short_pith_number":"pith:UMABFLIN","schema_version":"1.0","canonical_sha256":"a30012ad0dce6cee455c8148acf15b660f1d088ed2f910f4ec784d31604ab7b2","source":{"kind":"arxiv","id":"1902.05529","version":1},"attestation_state":"computed","paper":{"title":"Parameterized Fine-Grained Reductions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Antonis Antonopoulos, Aris Pagourtzis, Elli Anastasiadi, Stavros Petsalakis","submitted_at":"2019-02-14T18:10:23Z","abstract_excerpt":"During recent years the field of fine-grained complexity has bloomed to produce a plethora of results, with both applied and theoretical impact on the computer science community. The cornerstone of the framework is the notion of fine-grained reductions, which correlate the exact complexities of problems such that improvements in their running times or hardness results are carried over. We provide a parameterized viewpoint of these reductions (PFGR) in order to further analyze the structure of improvable problems and set the foundations of a unified methodology for extending algorithmic results"},"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":"1902.05529","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2019-02-14T18:10:23Z","cross_cats_sorted":[],"title_canon_sha256":"98e278535f67fec68330b031b70cafc04fc419e334db84d1dea3b04945a38c87","abstract_canon_sha256":"d3c83c03311e4fa69554b5728ec747095ce5ba549c105ba4ab4b4ac995913d8e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:53:58.460070Z","signature_b64":"IO26MxyucUt/LTQjSJdeARsm/LcjctzgZObCkIZoYq0cKyn3lJC33ldQMvyRRZRqExEEMsPmXs1drjOcDHETCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a30012ad0dce6cee455c8148acf15b660f1d088ed2f910f4ec784d31604ab7b2","last_reissued_at":"2026-05-17T23:53:58.459459Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:53:58.459459Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Parameterized Fine-Grained Reductions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Antonis Antonopoulos, Aris Pagourtzis, Elli Anastasiadi, Stavros Petsalakis","submitted_at":"2019-02-14T18:10:23Z","abstract_excerpt":"During recent years the field of fine-grained complexity has bloomed to produce a plethora of results, with both applied and theoretical impact on the computer science community. The cornerstone of the framework is the notion of fine-grained reductions, which correlate the exact complexities of problems such that improvements in their running times or hardness results are carried over. We provide a parameterized viewpoint of these reductions (PFGR) in order to further analyze the structure of improvable problems and set the foundations of a unified methodology for extending algorithmic results"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.05529","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1902.05529","created_at":"2026-05-17T23:53:58.459539+00:00"},{"alias_kind":"arxiv_version","alias_value":"1902.05529v1","created_at":"2026-05-17T23:53:58.459539+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.05529","created_at":"2026-05-17T23:53:58.459539+00:00"},{"alias_kind":"pith_short_12","alias_value":"UMABFLINZZWO","created_at":"2026-05-18T12:33:30.264802+00:00"},{"alias_kind":"pith_short_16","alias_value":"UMABFLINZZWO4RK4","created_at":"2026-05-18T12:33:30.264802+00:00"},{"alias_kind":"pith_short_8","alias_value":"UMABFLIN","created_at":"2026-05-18T12:33:30.264802+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/UMABFLINZZWO4RK4QFEKZ4K3MY","json":"https://pith.science/pith/UMABFLINZZWO4RK4QFEKZ4K3MY.json","graph_json":"https://pith.science/api/pith-number/UMABFLINZZWO4RK4QFEKZ4K3MY/graph.json","events_json":"https://pith.science/api/pith-number/UMABFLINZZWO4RK4QFEKZ4K3MY/events.json","paper":"https://pith.science/paper/UMABFLIN"},"agent_actions":{"view_html":"https://pith.science/pith/UMABFLINZZWO4RK4QFEKZ4K3MY","download_json":"https://pith.science/pith/UMABFLINZZWO4RK4QFEKZ4K3MY.json","view_paper":"https://pith.science/paper/UMABFLIN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1902.05529&json=true","fetch_graph":"https://pith.science/api/pith-number/UMABFLINZZWO4RK4QFEKZ4K3MY/graph.json","fetch_events":"https://pith.science/api/pith-number/UMABFLINZZWO4RK4QFEKZ4K3MY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UMABFLINZZWO4RK4QFEKZ4K3MY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UMABFLINZZWO4RK4QFEKZ4K3MY/action/storage_attestation","attest_author":"https://pith.science/pith/UMABFLINZZWO4RK4QFEKZ4K3MY/action/author_attestation","sign_citation":"https://pith.science/pith/UMABFLINZZWO4RK4QFEKZ4K3MY/action/citation_signature","submit_replication":"https://pith.science/pith/UMABFLINZZWO4RK4QFEKZ4K3MY/action/replication_record"}},"created_at":"2026-05-17T23:53:58.459539+00:00","updated_at":"2026-05-17T23:53:58.459539+00:00"}