{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:3SB5FX5K5CJTETPSDYWIDS6M5I","short_pith_number":"pith:3SB5FX5K","schema_version":"1.0","canonical_sha256":"dc83d2dfaae893324df21e2c81cbccea37c47d116b8c6222d698cf80b32b939e","source":{"kind":"arxiv","id":"2507.10709","version":1},"attestation_state":"computed","paper":{"title":"Interaction between skew-representability, tensor products, extension properties, and rank inequalities","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Andr\\'as Imolay, Bogl\\'arka Geh\\'er, Carles Padr\\'o, Krist\\'of B\\'erczi, L\\'aszl\\'o Lov\\'asz, Tam\\'as Schwarcz","submitted_at":"2025-07-14T18:22:35Z","abstract_excerpt":"Skew-representable matroids form a fundamental class in matroid theory, bridging combinatorics and linear algebra. They play an important role in areas such as coding theory, optimization, and combinatorial geometry, where linear structure is crucial for both theoretical insights and algorithmic applications. Since deciding skew-representability is computationally intractable, much effort has been focused on identifying necessary or sufficient conditions for a matroid to be skew-representable.\n  In this paper, we introduce a novel approach to studying skew-representability and structural prope"},"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":"2507.10709","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-07-14T18:22:35Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"f494023f4092273c6a6dd0cc22ca0d8a3d7d6d3526c02ef38f59b9a08a189587","abstract_canon_sha256":"df66fbb2605647112aa92d96003a2506f2a69a6f6e234ba6c5ec324ded9511a6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:36:58.758129Z","signature_b64":"04F7i+giuOjR9KUXK0+CXFOMVBIFD8tDPAbGeCI+RY9eU2YfVFVKnNZ3L2MajA6uRtDV3BbpjB1UmM/0mU2MDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dc83d2dfaae893324df21e2c81cbccea37c47d116b8c6222d698cf80b32b939e","last_reissued_at":"2026-07-05T11:36:58.757633Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:36:58.757633Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Interaction between skew-representability, tensor products, extension properties, and rank inequalities","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Andr\\'as Imolay, Bogl\\'arka Geh\\'er, Carles Padr\\'o, Krist\\'of B\\'erczi, L\\'aszl\\'o Lov\\'asz, Tam\\'as Schwarcz","submitted_at":"2025-07-14T18:22:35Z","abstract_excerpt":"Skew-representable matroids form a fundamental class in matroid theory, bridging combinatorics and linear algebra. They play an important role in areas such as coding theory, optimization, and combinatorial geometry, where linear structure is crucial for both theoretical insights and algorithmic applications. Since deciding skew-representability is computationally intractable, much effort has been focused on identifying necessary or sufficient conditions for a matroid to be skew-representable.\n  In this paper, we introduce a novel approach to studying skew-representability and structural prope"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.10709","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2507.10709/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2507.10709","created_at":"2026-07-05T11:36:58.757695+00:00"},{"alias_kind":"arxiv_version","alias_value":"2507.10709v1","created_at":"2026-07-05T11:36:58.757695+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.10709","created_at":"2026-07-05T11:36:58.757695+00:00"},{"alias_kind":"pith_short_12","alias_value":"3SB5FX5K5CJT","created_at":"2026-07-05T11:36:58.757695+00:00"},{"alias_kind":"pith_short_16","alias_value":"3SB5FX5K5CJTETPS","created_at":"2026-07-05T11:36:58.757695+00:00"},{"alias_kind":"pith_short_8","alias_value":"3SB5FX5K","created_at":"2026-07-05T11:36:58.757695+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2508.11636","citing_title":"Rigidity of Graphs and Frameworks: A Matroid Theoretic Approach","ref_index":7,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/3SB5FX5K5CJTETPSDYWIDS6M5I","json":"https://pith.science/pith/3SB5FX5K5CJTETPSDYWIDS6M5I.json","graph_json":"https://pith.science/api/pith-number/3SB5FX5K5CJTETPSDYWIDS6M5I/graph.json","events_json":"https://pith.science/api/pith-number/3SB5FX5K5CJTETPSDYWIDS6M5I/events.json","paper":"https://pith.science/paper/3SB5FX5K"},"agent_actions":{"view_html":"https://pith.science/pith/3SB5FX5K5CJTETPSDYWIDS6M5I","download_json":"https://pith.science/pith/3SB5FX5K5CJTETPSDYWIDS6M5I.json","view_paper":"https://pith.science/paper/3SB5FX5K","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2507.10709&json=true","fetch_graph":"https://pith.science/api/pith-number/3SB5FX5K5CJTETPSDYWIDS6M5I/graph.json","fetch_events":"https://pith.science/api/pith-number/3SB5FX5K5CJTETPSDYWIDS6M5I/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3SB5FX5K5CJTETPSDYWIDS6M5I/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3SB5FX5K5CJTETPSDYWIDS6M5I/action/storage_attestation","attest_author":"https://pith.science/pith/3SB5FX5K5CJTETPSDYWIDS6M5I/action/author_attestation","sign_citation":"https://pith.science/pith/3SB5FX5K5CJTETPSDYWIDS6M5I/action/citation_signature","submit_replication":"https://pith.science/pith/3SB5FX5K5CJTETPSDYWIDS6M5I/action/replication_record"}},"created_at":"2026-07-05T11:36:58.757695+00:00","updated_at":"2026-07-05T11:36:58.757695+00:00"}